A pivoting procedure for a class of second-order cone programming

We propose a pivoting procedure for a class of second-order cone programming (SOCP) problems having one second-order cone, but possibly with additional non-negative variables. We introduce a dictionary, basic variables, nonbasic variables, and other necessary concepts to define a pivot for this class of SOCP problems. In a pivot, two-dimensional SOCP subproblems are solved to decide which variables should be entering or leaving the basis. Under a nondegeneracy assumption, we prove that the objective function value is strictly decreasing by a pivot unless the current basic solution is optimal. We also propose an algorithm using the pivoting procedure which has a global convergence property.

[1]  G. Pataki.  Cone-LP ' s and Semidefinite Programs : Geometry and a Simplex-Type Method , 2022 .

[2]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[3]  Kim-Chuan Toh,et al.  Solving Second Order Cone Programming via a Reduced Augmented System Approach , 2006, SIAM J. Optim..

[4]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[5]  L. Faybusovich.  Euclidean Jordan Algebras and Interior-point Algorithms , 1997 .

[6]  Masakatsu Muramatsu,et al.  A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS , 2003 .

[7]  Takashi Tsuchiya,et al.  Optimal Magnetic Shield Design with Second-Order Cone Programming , 2002, SIAM J. Sci. Comput..

[8]  Aharon Ben-Tal,et al.  Lectures on modern convex optimization , 1987 .

[9]  Erling D. Andersen,et al.  On implementing a primal-dual interior-point method for conic quadratic optimization , 2003, Math. Program..

[10]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[11]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

[12]  Takashi Tsuchiya,et al.  Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions , 2000, Math. Program..

[13]  J. Lasserre.  Linear programming with positive semi-definite matrices , 1996 .

[14]  Michael J. Todd,et al.  Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..

[15]  T. Tsuchiya.  A Convergence Analysis of the Scaling-invariant Primal-dual Path-following Algorithms for Second-ord , 1998 .

[16]  L. Faybusovich.  Linear systems in Jordan algebras and primal-dual interior-point algorithms , 1997 .

[17]  M. Muramatsu.  On a Commutative Class of Search Directions for Linear Programming over Symmetric Cones , 2002 .