Penalty/Barrier Multiplier Methods for Convex Programming Problems
- 1 May 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 7 (2), 347-366
- https://doi.org/10.1137/s1052623493259215
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Penalty/Barrier Multiplier Methods for Convex Programming ProblemsSIAM Journal on Optimization, 1997
- An Analytical Model to Predict Optimal Material Properties in the Context of Optimal Structural DesignJournal of Applied Mechanics, 1994
- Entropy-Like Proximal Methods in Convex ProgrammingMathematics of Operations Research, 1994
- Optimization methods for truss geometry and topology designStructural and Multidisciplinary Optimization, 1994
- On the convergence of the exponential multiplier method for convex programmingMathematical Programming, 1993
- A New Method for Optimal Truss Topology DesignSIAM Journal on Optimization, 1993
- Entropic Proximal Mappings with Applications to Nonlinear ProgrammingMathematics of Operations Research, 1992
- Modified barrier functions (theory and methods)Mathematical Programming, 1992
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976
- A dual approach to solving nonlinear programming problems by unconstrained optimizationMathematical Programming, 1973