On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- 1 August 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 4 (3), 486-511
- https://doi.org/10.1137/0804027
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A Structure-Exploiting Algorithm for Nonlinear Minimax ProblemsSIAM Journal on Optimization, 1992
- LancelotPublished by Springer Nature ,1992
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- An exact penalty function method with global convergence properties for nonlinear programming problemsMathematical Programming, 1986
- Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region ApproachACM Transactions on Mathematical Software, 1983
- Robust StatisticsWiley Series in Probability and Statistics, 1981
- A lower bound for the controlling parameters of the exact penalty functionsMathematical Programming, 1978
- An Efficient Method to Solve the Minimax Problem DirectlySIAM Journal on Numerical Analysis, 1978
- Necessary and sufficient conditions for a penalty method to be exactMathematical Programming, 1975
- Nondifferentiable optimization via approximationPublished by Springer Nature ,1975