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

DOI10.1080/10556788.2015.1121487MaRDI QIDQ2829585zbMATH OpenOpenAlexFDO

Authors Shunsuke Hayashi, Takayuki Okuno, Yoshihiko Ito

Publication date 8 November 2016

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

simplex methodlinear semi-infinite programmesecond-order cone programme

Mathematics Subject Classification ID

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

Recommendations

• A variant of the simplex method for second-order cone programming
• The dual simplex-type method for linear second-order cone programming problem
• Second-order cone programming
• Lagrange dual problem of second-order cone programming and its 2-dimensional primal-dual simplex method
• The Variant of Primal Simplex-Type Method for Linear Second-Order Cone Programming

Cites work

• scientific article; zbMATH DE number 1070896 (Why is no real title available?)
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
• A new exchange method for convex semi-infinite programming
• A pivoting procedure for a class of second-order cone programming
• A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
• An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
• Applications of second-order cone programming
• Geometric fundamentals of the simplex method in semi-infinite programming
• On Linear Semi-Infinite Programming Problems: An Algorithm
• Optimal Magnetic Shield Design with Second-Order Cone Programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Second-order cone programming
• Semidefinite Programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(12)

• Two-phase simplex method for linear semidefinite optimization
• A quadratically convergent sequential programming method for second-order cone programs capable of warm starts
• A variant of the simplex method for second-order cone programming
• The Variant of Primal Simplex-Type Method for Linear Second-Order Cone Programming
• Recent contributions to linear semi-infinite optimization: an update
• Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
• Recent contributions to linear semi-infinite optimization
• Three-dimensional plasticity-based topology optimization with smoothed finite element analysis
• The dual simplex-type method for linear second-order cone programming problem
• On polyhedral and second-order cone decompositions of semidefinite optimization problems
• Extension of the LP-Newton method to conic programming problems via semi-infinite representation
• Primal Newton method for the linear cone programming problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829585)