Two general methods for computing saddle points with applications for decomposing convex programming problems-Reference-Cited by-同舟云学术

Two general methods for computing saddle points with applications for decomposing convex programming problems

Published:1985-04 Issue:1 Volume:13 Page:79-95
ISSN:0095-4616
Container-title:Applied Mathematics & Optimization
language:en
Short-container-title:Appl Math Optim

Author:

Auslender A.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF01442200.pdf

Reference13 articles.

1. Auslender A (1976) Optimization m�thodes num�riques. Masson, Paris

2. Auslender A Probl�mes de minimax via l'analyse convexe et les in�galit�s variationnelles. Th�orie et algorithme, Lecture Notes in Economics and Mathematical Systems 77. Springer Verlag, New York

3. Cohen G (1984) Decomposition at coordination en optimization d�terministe et nondifferentiable. (Th�se)

4. Dantzig GB (1963) Linear programming and extensions. Princeton University, Press, Princeton

5. Demjanov W, Pevny AB (1972) Numerical methods for finding saddle points. U.S.S.R. Computational Mathematics and Mathematical Physics, 12:11?53

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework;Optimization Methods and Software;2004-10

2. Numerical Considerations on Decomposition and Augmented Lagrangians;Lecture Notes in Economics and Mathematical Systems;2000

3. On the convergence of the proximal algorithm for saddle-point problems;Optimization;1995-01

4. Decomposition Schemes for Finding Saddle Points of Quasi-Convex-Concave Functions;Quantitative Methoden in den Wirtschaftswissenschaften;1989

5. About the finite convergence of the proximal point algorithm;Trends in Mathematical Optimization;1988