An active-set method for second-order conic-constrained quadratic programming
From MaRDI portal
(Redirected from Publication:5502239)
Recommendations
- An Active Set Method for Single-Cone Second-Order Cone Programs
- Methods for convex and general quadratic programming
- scientific article; zbMATH DE number 2050896
- The \(Q\) method for second order cone programming
- An alternating direction method for convex quadratic second-order cone programming with bounded constraints
Cites work
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Globally Convergent Stabilized SQP Method
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A second derivative SQP method: global convergence
- Accuracy and Stability of Numerical Algorithms
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- On a positive semidefinite relaxation of the cut polytope
- On the Goldstein-Levitin-Polyak gradient projection method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Perturbation analysis of second-order cone programming problems
- Projected gradient methods for linearly constrained problems
- Reflection-projection method for convex feasibility problems with an obtuse cone
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Second-order cone programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Subgradient based outer approximation for mixed integer second order cone programming
- The Gradient Projection Method under Mild Differentiability Conditions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Variational Analysis
Cited in
(10)- An active-set algorithm for norm constrained quadratic problems
- Methods for convex and general quadratic programming
- Extended formulations in mixed-integer convex programming
- An active set algorithm for nonlinear optimization with polyhedral constraints
- An Active Set Method for Single-Cone Second-Order Cone Programs
- A feasible direction algorithm for nonlinear second-order cone programs
- A Krylov subspace method for large-scale second-order cone linear complementarity problem
- A quadratically convergent sequential programming method for second-order cone programs capable of warm starts
- Minimizing a weighted barrier function subject to second-order cone and linear equality constraints
- Model predictive control of hypersonic vehicles accommodating constraints
This page was built for publication: An active-set method for second-order conic-constrained quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502239)
