On the Sequential Quadratically Constrained Quadratic Programming Methods
From MaRDI portal
Publication:5704159
DOI10.1287/moor.1030.0069zbMath1082.90140OpenAlexW2169768001MaRDI QIDQ5704159
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.4124
Related Items (26)
A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem ⋮ DC Programming and DCA for General DC Programs ⋮ A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming ⋮ A new global algorithm for factor-risk-constrained mean-variance portfolio selection ⋮ Open issues and recent advances in DC programming and DCA ⋮ An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming ⋮ A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ 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 ⋮ 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 reduced Hessian SQP method for inequality constrained optimization ⋮ 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 ⋮ A practical update criterion for SQP method ⋮ Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs ⋮ Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere ⋮ A sequential quadratically constrained quadratic programming method for unconstrained minimax problems ⋮ A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
Uses Software
This page was built for publication: On the Sequential Quadratically Constrained Quadratic Programming Methods
