Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation-Reference-Cited by-同舟云学术

Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation

Published:1988 Issue: Volume: Page:103-124
ISSN:0075-8442
Container-title:Optimization, Parallel Processing and Applications
language:
Short-container-title:

Author:

De Leone R.,Mangasarian O. L.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-46631-1_11

Reference22 articles.

1. D. P. Bertsekas: “Necessary and sufficient conditions for a penalty method to be exact”, Mathematical Programming 9, 1975, 87–99.

2. D. P. Bertsekas: “Constrained optimization and Lagrange multiplier methods”, Academic Press, New York 1982.

3. E. G. Golshtein: “An iterative linear programming algorithm based on the use of modified Lagrange function”, US-USSR Seminar on Distribution and Production Problems of Industry and Enterprise, October 15–17, 1980, University of Maryland, College Park, Proceedings Published in College Park, Maryland 1982.

4. Y. Y. Lin, J. S. Pang: “Iterative methods for large convex quadratic programs: A survey”, SIAM Journal on Control and Optimization 25, 1987, 383–411.

5. O. L. Mangasarian: “Nonlinear programming”, McGraw-Hill, New York 1969.

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

1. A hybrid algorithm for solving linear inequalities in a least squares sense;Numerical Algorithms;2008-07-05

2. A stable primal–dual approach for linear programming under nondegeneracy assumptions;Computational Optimization and Applications;2007-12-20

3. Data Discrimination via Nonlinear Generalized Support Vector Machines;Complementarity: Applications, Algorithms and Extensions;2001

4. Guest Editorial;Computational Optimization;1999

5. A Gauss—Newton method for convex composite optimization;Mathematical Programming;1995-12