A pivoting procedure for a class of second-order cone programming

DOI10.1080/10556780500094697zbMath1095.90117OpenAlexW2025132271MaRDI QIDQ5478872

Masakazu Muramatsu

Publication date: 13 July 2006

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

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

zbMATH Keywords

Second-order cone programmingPivoting methods

Mathematics Subject Classification ID

Convex programming (90C25) Extreme-point and pivoting methods (90C49)

Related Items (6)

Primal Newton method for the linear cone programming problem ⋮ The dual simplex-type method for linear second-order cone programming problem ⋮ A variant of the affine-scaling method for a second-order cone program ⋮ Extension of the LP-Newton method to conic programming problems via semi-infinite representation ⋮ Two-phase simplex method for linear semidefinite optimization ⋮ Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation

Cites Work

• Unnamed Item
• Applications of second-order cone programming
• Linear programming with positive semi-definite matrices
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• On a commutative class of search directions for linear programming over symmetric cones
• Lectures on Modern Convex Optimization
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Optimal Magnetic Shield Design with Second-Order Cone Programming
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming

This page was built for publication: A pivoting procedure for a class of second-order cone programming