A Feasible Active Set QP-Free Method for Nonlinear Programming
From MaRDI portal
Publication:3440215
DOI10.1137/040605904zbMath1165.90640OpenAlexW2033531890MaRDI QIDQ3440215
Lifeng Chen, Guo-Ping He, Yong-Li Wang
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
global convergencestrict complementarityconstrained optimizationnonlinear programmingsuperlinear convergenceQP-free methods
Related Items (17)
Feasible methods for nonconvex nonsmooth problems with applications in green communications ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization ⋮ 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 ⋮ 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 QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY ⋮ The use of QP-free algorithm in the limit analysis of slope stability ⋮ A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem ⋮ A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization ⋮ A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ 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
Uses Software
This page was built for publication: A Feasible Active Set QP-Free Method for Nonlinear Programming
