An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming

DOI10.1080/10556788.2017.1382495zbMath1461.65167arXiv1611.01898OpenAlexW2551627961MaRDI QIDQ4638909

No author found.

Publication date: 2 May 2018

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

Full work available at URL: https://arxiv.org/abs/1611.01898

zbMATH Keywords

linear programmingsecond-order cone programmingChubanov's algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (10)

Implementation of a projection and rescaling algorithm for second-order conic feasibility problems ⋮ Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion ⋮ A new extension of Chubanov's method to symmetric cones ⋮ An extension of Chubanov's algorithm to symmetric cones ⋮ Extension of the LP-Newton method to conic programming problems via semi-infinite representation ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ A polynomial algorithm for convex quadratic optimization subject to linear inequalities ⋮ Enhanced basic procedures for the projection and rescaling algorithm ⋮ Computational performance of a projection and rescaling algorithm ⋮ Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly polynomial algorithm for linear systems having a binary solution
• A polynomial projection algorithm for linear feasibility problems
• A new polynomial-time algorithm for linear programming
• 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
• Solving conic systems via projection and rescaling
• Solving second-order conic systems with variable precision
• On Chubanov's Method for Linear Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming

This page was built for publication: An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming