Perturbation Methods for Saddle Point Computation
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.
|Date of creation:||May 1994|
|Date of revision:|
|Contact details of provider:|| Postal: A-2361 Laxenburg|
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
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.:
- M.J. Kallio & A. Ruszczynski, 1994. "Parallel Solution of Linear Programs Via Nash Equilibria," Working Papers wp94015, International Institute for Applied Systems Analysis.
- A. Ruszczynski, 1994. "A Partial Regularization Method for Saddle Point Seeking," Working Papers wp94020, International Institute for Applied Systems Analysis.
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 references are entirely missing, you can add them using this form.