An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities

The convex feasibility problem in general is a problem of finding a point in a convex set that contains a full dimensional ball and is contained in a compact convex set. We assume that the outer set is described by second-order cone inequalities and propose an analytic center cutting plane technique to solve this problem. We discuss primal and dual settings simultaneously. Two complexity results are reported: the complexity of restoration procedure and complexity of the overall algorithm. We prove that an approximate analytic center is updated after adding a second-order cone cut (SOCC) inO(1) Newton step, and that the analytic center cutting plane method (ACCPM) with SOCC is a fully polynomial algorithm.

[1]  John E. Mitchell,et al.  A unifying framework for several cutting plane methods for semidefinite programming , 2006, Optim. Methods Softw..

[2]  Hans-Jakob Lüthi,et al.  The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems , 2000, SIAM J. Optim..

[3]  K. Krishnan.  A Linear Programming Approach to Semidefinite Programming Problems , 2007 .

[4]  Hans-Jakob L Uthi,et al.  The Analytic Center Quadratic Cut Method (acqcm) for Strongly Monotone Variational Inequality Problems , 1998 .

[5]  Yinyu Ye,et al.  Complexity analysis of the analytic center cutting plane method that uses multiple cuts , 1997, Math. Program..

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

[7]  Jean-Louis Goffin,et al.  A matrix generation approach for eigenvalue optimization , 2007, Math. Program..

[8]  Andreas Griewank,et al.  On constrained optimization by adjoint based quasi-Newton methods , 2002, Optim. Methods Softw..

[9]  John E. Mitchell,et al.  Computational Experience with an Interior Point Cutting Plane Algorithm , 1999, SIAM J. Optim..

[10]  G. Sonnevend.  New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation , 1988 .

[11]  Yinyu Ye,et al.  A Potential Reduction Algorithm Allowing Column Generation , 1992, SIAM J. Optim..

[12]  Pravin M. Vaidya,et al.  A cutting plane algorithm for convex programming that uses analytic centers , 1995, Math. Program..

[13]  Kim-Chuan Toh,et al.  An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems , 2002, Math. Oper. Res..

[14]  Jean-Louis Goffin,et al.  An analytic center quadratic cut method for the convex quadratic feasibility problem , 2002, Math. Program..

[15]  C. Theobald.  An inequality for the trace of the product of two symmetric matrices , 1975 .

[16]  Kim-Chuan Toh,et al.  Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method , 2002, SIAM J. Optim..

[17]  Kim-Chuan Toh,et al.  Analytic Center Cutting-Plane Method with Deep Cuts for Semidefinite Feasibility Problems , 2004 .

[18]  J. Mitchell,et al.  Semi-infinite linear programming approaches to semidefinite programming problems∗ , 2007 .

[19]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[20]  Yinyu Ye,et al.  Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems , 1996, SIAM J. Optim..

[21]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[22]  Kim-Chuan Toh,et al.  A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems , 2002, SIAM J. Optim..

[23]  Jie Sun,et al.  An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems , 1998, SIAM J. Optim..

[24]  Jean-Louis Goffin,et al.  The Analytic Center Cutting Plane Method with Semidefinite Cuts , 2002, SIAM J. Optim..

[25]  Jean-Philippe Vial,et al.  Multiple Cuts in the Analytic Center Cutting Plane Method , 1998, SIAM J. Optim..

[26]  J. Goffin,et al.  Decomposition and nondifferentiable optimization with the projective algorithm , 1992 .

[27]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .

[28]  Michael J. Todd,et al.  Solving combinatorial optimization problems using Karmarkar's algorithm , 1992, Math. Program..

[29]  Jean-Louis Goffin,et al.  A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems , 1996, SIAM J. Optim..

[30]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[31]  Yurii Nesterov,et al.  Complexity estimates of some cutting plane methods based on the analytic barrier , 1995, Math. Program..

[32]  P. Pardalos,et al.  Novel Approaches to Hard Discrete Optimization , 2003 .