Advanced Search
MyIDEAS: Login

Perturbation Methods for Saddle Point Computation

Contents:

Author Info

  • M.J. Kallio
  • A. Ruszczynski

Abstract

A general class of iterative methods for saddle point seeking is developed. The directions used are subgradients evaluated at perturbed points. Convergence of the methods is proved and alternative strategies for implementation are discussed. The procedure suggests scalable algorithms for solving large-scale linear programs via saddle points. For illustration, some encouraging tests with the standard Lagrangian of linear programs from the Netlib library are reported.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://www.iiasa.ac.at/Publications/Documents/WP-94-038.ps
Download Restriction: no

Bibliographic Info

Paper provided by International Institute for Applied Systems Analysis in its series Working Papers with number wp94038.

as in new window
Length:
Date of creation: May 1994
Date of revision:
Handle: RePEc:wop:iasawp:wp94038

Contact details of provider:
Postal: A-2361 Laxenburg
Phone: +43-2236-807-0
Fax: +43-2236-71313
Email:
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC

Related research

Keywords:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. A. Ruszczynski, 1994. "A Partial Regularization Method for Saddle Point Seeking," Working Papers wp94020, International Institute for Applied Systems Analysis.
  2. M.J. Kallio & A. Ruszczynski, 1994. "Parallel Solution of Linear Programs Via Nash Equilibria," Working Papers wp94015, International Institute for Applied Systems Analysis.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Flam, Sjur & Ruszczynski, A., 2006. "Computing Normalized Equilibria in Convex-Concave Games," Working Papers 2006:9, Lund University, Department of Economics.
  2. S.D. Flam & A. Ruszczynski, 1994. "Noncooperative Convex Games: Computing Equilibrium By Partial Regularization," Working Papers wp94042, International Institute for Applied Systems Analysis.
  3. M.J. Kallio & C.H. Rosa, 1994. "Large-Scale Convex Optimization via Saddle Point Computation," Working Papers wp94107, International Institute for Applied Systems Analysis.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp94038. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.