Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation

DOI10.1080/10556788.2015.1121487zbMath1386.90076OpenAlexW2185310671MaRDI QIDQ2829585

Yoshihiko Ito, Shunsuke Hayashi, Takayuki Okuno

Publication date: 8 November 2016

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

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

zbMATH Keywords

simplex methodsecond-order cone programmelinear semi-infinite programme

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Extreme-point and pivoting methods (90C49)

Related Items (6)

Primal Newton method for the linear cone programming problem ⋮ Recent contributions to linear semi-infinite optimization ⋮ The dual simplex-type method for linear second-order cone programming problem ⋮ Extension of the LP-Newton method to conic programming problems via semi-infinite representation ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Two-phase simplex method for linear semidefinite optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric fundamentals of the simplex method in semi-infinite programming
• Applications of second-order cone programming
• Second-order cone programming
• A New Exchange Method for Convex Semi-Infinite Programming
• An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
• On Linear Semi-Infinite Programming Problems: An Algorithm
• 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
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Semidefinite Programming
• A Regularized Explicit Exchange Method for Semi-Infinite Programs with an Infinite Number of Conic Constraints
• A pivoting procedure for a class of second-order cone programming

This page was built for publication: Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation