A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
DOI10.1016/J.AMC.2009.04.022zbMATH Open1180.65077OpenAlexW2011775228MaRDI QIDQ833162FDOQ833162
Authors: Xiao-Yan Ke, Weixin Cheng, Jinbao Jian 
Publication date: 12 August 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.022
Recommendations
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
numerical resultsalgorithmconstrained optimizationglobal convergencesuperlinear convergenceMaratos effectnorm-relaxed SQP methodsuccessive quadratic programming (SQP) methodMangasarian-Fromovitz constraint qualificationnonlinear optimization with inequalitiesnorm-relaxed methodsub-feasible directions
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)
Cites Work
- Test examples for nonlinear programming codes
- A new SQP method of feasible directions for nonlinear programming.
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A computationally efficient feasible sequential quadratic programming algorithm
- Title not available (Why is that?)
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A surperlinearly convergent algorithm for constrained optimization problems
- Title not available (Why is that?)
- A superlinearly convergent method of feasible directions.
- Combined phase I—phase II methods of feasible directions
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- A generalization of the norm-relaxed method of feasible directions
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
Cited In (12)
- Optimal maximally decimated m-channel mirrored paraunitary linear phase FIR filter bank design via norm relaxed sequential quadratic programming
- A norm-relaxed algorithm with an identification function for general constrained optimization
- A strongly sub-feasible norm-relaxed SQP algorithm of multiple directions with parallel computing
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- On the accurate identification of active set for constrained minimax problems
Uses Software
This page was built for publication: A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833162)
