An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming
From MaRDI portal
Publication:5502239
DOI10.1137/140958025zbMath1327.90167OpenAlexW944359287MaRDI QIDQ5502239
Publication date: 18 August 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140958025
Related Items
Extended Formulations in Mixed-Integer Convex Programming, An active set algorithm for nonlinear optimization with polyhedral constraints, A feasible direction algorithm for nonlinear second-order cone programs, A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem
Uses Software
Cites Work
- Unnamed Item
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Second-order cone programming
- On a positive semidefinite relaxation of the cut polytope
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perturbation analysis of second-order cone programming problems
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Second Derivative SQP Method: Global Convergence
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Projected gradient methods for linearly constrained problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the Goldstein-Levitin-Polyak gradient projection method
- Variational Analysis
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Accuracy and Stability of Numerical Algorithms
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
- A Globally Convergent Stabilized SQP Method
- The Gradient Projection Method under Mild Differentiability Conditions