A Note on the Simplex Method for 2-Dimensional Second-Order Cone Programming

DOI10.1007/11758501_21zbMATH Open1155.65354OpenAlexW1518401069MaRDI QIDQ3545017FDOQ3545017

Authors: Yu Xia 

Publication date: 9 December 2008

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758501_21

Recommendations

• Two-dimensional second-order cone programming
• Dual simplex method for 2-dimensional second-order cone programming
• Lagrange dual problem of second-order cone programming and its 2-dimensional primal-dual simplex method
• A variant of the simplex method for second-order cone programming
• The dual simplex-type method for linear second-order cone programming problem

zbMATH Keywords

linear programmingsensitivity analysisbasissecond-order cone programmingsimplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cited In (9)

• Two-dimensional second-order cone programming
• A pivoting procedure for a class of second-order cone programming
• Statistical inference of second-order cone programming
• Cone-cutting: a variant representation of pivot in simplex
• The Variant of Primal Simplex-Type Method for Linear Second-Order Cone Programming
• A variant of the simplex method for second-order cone programming
• Dual simplex method for 2-dimensional second-order cone programming
• Lagrange dual problem of second-order cone programming and its 2-dimensional primal-dual simplex method
• The dual simplex-type method for linear second-order cone programming problem

This page was built for publication: A Note on the Simplex Method for 2-Dimensional Second-Order Cone Programming

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