The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction

DOI10.1080/10556788.2016.1270279zbMath1398.90206OpenAlexW2578091951MaRDI QIDQ4638912

Florian Jarre, Felix Lieder

Publication date: 2 May 2018

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2016.1270279

zbMATH Keywords

Jordan algebrasecond-order cone programSQP subproblem

Mathematics Subject Classification ID

Interior-point methods (90C51) Methods of successive quadratic programming type (90C55)

Related Items (1)

On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem

Uses Software

• Unnamed Item
• SeDuMi
• SDPT3
• GQTPAR
• ECOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• On a subproblem of trust region algorithms for constrained optimization
• Applications of second-order cone programming
• A trust region algorithm for equality constrained optimization
• Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• Second-order cone programming
• Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
• On the convergence of a new trust region algorithm
• Recent advances in trust region algorithms
• Cubic regularization of Newton method and its global performance
• Lectures on Modern Convex Optimization
• Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming
• A Note on Polynomial Solvability of the CDT Problem
• Cubic overestimation and secant updating for unconstrained optimization ofC^{2, 1}functions
• Computing a Trust Region Step
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation
• A model algorithm for composite nondifferentiable optimization problems
• On the Implementation of a Primal-Dual Interior Point Method
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• On the Nesterov--Todd Direction in Semidefinite Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• On Local Solutions of the Celis--Dennis--Tapia Subproblem
• Nonpolyhedral Relaxations of Graph-Bisection Problems
• On Cones of Nonnegative Quadratic Functions
• Nonlinear programming without a penalty function.

This page was built for publication: The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction