A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
From MaRDI portal
Publication:2706318
DOI10.1137/S1052623499353935zbMath0999.90038OpenAlexW1988641273MaRDI QIDQ2706318
Publication date: 19 March 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623499353935
Related Items (37)
A globally convergent QP-free algorithm for nonlinear semidefinite programming ⋮ A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ A new filter QP-free method for the nonlinear inequality constrained optimization problem ⋮ Feasible methods for nonconvex nonsmooth problems with applications in green communications ⋮ A modified SQP algorithm for minimax problems ⋮ An infeasible nonmonotone SSLE algorithm for nonlinear programming ⋮ Piecewise linear NCP function for QP free feasible method ⋮ An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization ⋮ Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ A superlinearly convergent numerical algorithm for nonlinear programming ⋮ Newton-KKT interior-point methods for indefinite quadratic programming ⋮ An improved feasible QP-free algorithm for inequality constrained optimization ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems ⋮ A smoothing QP-free infeasible method for nonlinear inequality constrained optimization ⋮ An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization ⋮ A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization ⋮ A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints ⋮ 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 ⋮ A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse ⋮ A nonmonotone filter method for nonlinear optimization ⋮ The use of QP-free algorithm in the limit analysis of slope stability ⋮ A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem ⋮ Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization ⋮ A modified QP-free feasible method ⋮ Sequential systems of linear equations method for general constrained optimization without strict complementarity ⋮ A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization ⋮ A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ A kind of QP-free feasible method ⋮ The revised DFP algorithm without exact line search ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization ⋮ A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints ⋮ A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
This page was built for publication: A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
