A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
From MaRDI portal
Publication:4785857
DOI10.1137/S1052623499365309zbMath1035.90081MaRDI QIDQ4785857
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem ⋮ A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ A method of sequential log-convex programming for engineering design ⋮ Quaternion matrix decomposition and its theoretical implications ⋮ Newton-type methods for constrained optimization with nonregular constraints ⋮ A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results ⋮ A working set SQCQP algorithm with simple nonmonotone penalty parameters ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function ⋮ A Globally Convergent SQCQP Method for Multiobjective Optimization Problems ⋮ A quadratically approximate framework for constrained optimization, global and local convergence ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems ⋮ On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ Newton-type methods: a broader view ⋮ Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ A sequential quadratically constrained quadratic programming method for unconstrained minimax problems ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
Uses Software
