Publication:2746550
From MaRDI portal
zbMath1054.90094MaRDI QIDQ2746550
Publication date: 2001
90C55: Methods of successive quadratic programming type
Related Items
A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, A quadratically approximate framework for constrained optimization, global and local convergence, A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization, A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity, A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization, An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity