A robust SQP method based on a smoothing lower order penalty function†
From MaRDI portal
Publication:3622004
Recommendations
- A SQP algorithm based on a smoothing lower order penalty function for inequality constrained optimization
- A robust SQP method based on a smoothing approximate penalty function for inequality constrained optimization.
- A SQP method based on a modified penalty function for nonlinear inequality constrained optimization problem
- A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
- scientific article; zbMATH DE number 151663
Cites work
- A globally convergent algorithm for nonlinearly constrained optimization problems
- A new technique for inconsistent QP problems in the SQP method
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A robust sequential quadratic programming method
- A sequential quadratic programming method for potentially infeasible mathematical programs
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- An exact lower order penalty function and its smoothing in nonlinear programming
- Exact penalty function algorithm with simple updating of the penalty parameter
- More test examples for nonlinear programming codes
- New Results on a Continuously Differentiable Exact Penalty Function
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
Cited in
(9)- A robust SQP method based on a smoothing approximate penalty function for inequality constrained optimization.
- Robust penalty function method for an uncertain multi-time control optimization problems
- Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach
- A second-order smooth penalty function algorithm for constrained optimization problems
- A SQP algorithm based on a smoothing lower order penalty function for inequality constrained optimization
- On smoothing $l_1$ exact penalty function for constrained optimization problems
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- A penalty function method based on smoothing lower order penalty function
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
This page was built for publication: A robust SQP method based on a smoothing lower order penalty function†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3622004)
