Implementing proximal point methods for linear programming
- 1 June 1990
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 65 (3) , 531-554
- https://doi.org/10.1007/bf00939565
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Iterative Methods for Large Convex Quadratic Programs: A SurveySIAM Journal on Control and Optimization, 1987
- Error bounds for monotone linear complementarity problemsMathematical Programming, 1986
- More results on the convergence of iterative methods for the symmetric linear complementarity problemJournal of Optimization Theory and Applications, 1986
- Truncated-Newton algorithms for large-scale unconstrained optimizationMathematical Programming, 1983
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976
- Necessary and sufficient conditions for a penalty method to be exactMathematical Programming, 1975
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969