Combined Primal–Dual and Penalty Methods for Convex Programming
- 1 February 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 14 (2) , 268-294
- https://doi.org/10.1137/0314020
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- On Penalty and Multiplier Methods for Constrained MinimizationSIAM Journal on Control and Optimization, 1976
- Necessary and sufficient conditions for a penalty method to be exactMathematical Programming, 1975
- Convergence bounds for nonlinear programming algorithmsMathematical Programming, 1975
- On the method of multipliers for convex programmingIEEE Transactions on Automatic Control, 1975
- Combined Primal-Dual and Penalty Methods for Constrained MinimizationSIAM Journal on Control, 1975
- A dual approach to solving nonlinear programming problems by unconstrained optimizationMathematical Programming, 1973
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- A new method for the optimization of a nonlinear function subject to nonlinear constraintsThe Computer Journal, 1970
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained ProblemsThe Computer Journal, 1966