The \(Q\) method for second order cone programming

DOI10.1016/j.cor.2006.08.009zbMath1278.90316OpenAlexW1603377283MaRDI QIDQ2459387

Yu Xia, Farid Alizadeh

Publication date: 6 November 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.08.009

zbMATH Keywords

second order cone programminginfeasible interior point method\(Q\) method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

The \(Q\) method for symmetric cone programming, A trust region SQP-filter method for nonlinear second-order cone programming, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step

Cites Work

• Unnamed Item
• Unnamed Item
• The \(Q\) method for symmetric cone programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• Second-order cone programming
• Product-form Cholesky factorization in interior point methods for second-order cone programming
• Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs
• On the Implementation of a Primal-Dual Interior Point Method
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications