A Penalty Function Method Converging Directly to a Constrained Optimum
From MaRDI portal
Cited in
(20)- A note on ‘new algorithms for constrained minimax optimization’
- A first order, exact penalty function algorithm for equality constrained optimization problems
- An SQP method for general nonlinear programs using only equality constrained subproblems
- An exact penalty function for semi-infinite programming
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- Exact penalty functions and stability in locally Lipschitz programming
- Discontinuous piecewise linear optimization
- Second-order conditions for an exact penalty function
- Nonlinear programming via an exact penalty function: Global analysis
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- A lower bound for the controlling parameters of the exact penalty functions
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Convergence analysis and competitive numerical results of a trust region-line search projected exact penalty algorithm
- Steplength algorithms for minimizing a class of nondifferentiable functions
- Combined phase I—phase II methods of feasible directions
- A proximal-gradient method for equality constrained optimization
- A superlinearly convergent exact penalty method for constrained nonlinear least squares: global analysis
- Necessary and sufficient conditions for a penalty method to be exact
- Steering exact penalty methods for nonlinear programming
This page was built for publication: A Penalty Function Method Converging Directly to a Constrained Optimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4135254)
