The dual simplex-type method for linear second-order cone programming problem

DOI10.1007/978-3-030-62867-3_22OpenAlexW3095473980MaRDI QIDQ2679794

Vitaliǐ Grigor'evich Zhadan

Publication date: 25 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-62867-3_22

zbMATH Keywords

linear second-order cone programmingfinite and infinite convergencedual simplex-type method

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Applications of second-order cone programming
• Second-order cone programming
• Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
• A variant of the simplex method for second-order cone programming
• Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Cone-LP's and semidefinite programs: Geometry and a simplex-type method
• A pivoting procedure for a class of second-order cone programming
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: The dual simplex-type method for linear second-order cone programming problem