A Feasible Active Set QP-Free Method for Nonlinear Programming

DOI10.1137/040605904MaRDI QIDQ3440215zbMATH OpenOpenAlexFDO

Authors Lifeng Chen, Yongli Wang, Guoping He

Publication date 22 May 2007

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/040605904

zbMATH Keywords

constrained optimizationglobal convergencenonlinear programmingQP-free methodsstrict complementaritysuperlinear convergence

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonlinear programming (90C30)

Recommendations

• An infeasible active-set QP-free algorithm for general nonlinear programming
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
• A QP-free method for nonlinear programming problems
• scientific article; zbMATH DE number 2112990
• An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization

Cited in

(18)

• A fast MPC algorithm using nonfeasible active set methods
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
• A global QP-free algorithm for mathematical programs with complementarity constraints
• A globally convergent QP-free algorithm for inequality constrained minimax optimization
• A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
• An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
• Feasible methods for nonconvex nonsmooth problems with applications in green communications
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
• A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
• An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
• AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
• An infeasible active-set QP-free algorithm for general nonlinear programming
• The use of QP-free algorithm in the limit analysis of slope stability
• A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
• An active set strategy based on the multiplier function or the gradient.
• A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
• A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization

Describes a project that uses

Uses Software

• Ipopt

This page was built for publication: A Feasible Active Set QP-Free Method for Nonlinear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440215)