Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities

In this paper we consider a new analytic center cutting plane method in an extended space. We prove the efficiency estimates for the general scheme and show that these results can be used in the analysis of a feasibility problem, the variational inequality problem, and the problem of constrained minimization. Our analysis is valid even for problems whose solution belongs to the boundary of the domain.

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

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

[3]  Y. Ye,et al.  On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problems , 1994 .

[4]  Y. Nesterov,et al.  Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming , 1994 .

[5]  Jean-Philippe Vial,et al.  Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming , 1994, Discret. Appl. Math..

[6]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[7]  W. Hager,et al.  Large Scale Optimization : State of the Art , 1993 .

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

[9]  Jean-Philippe Vial,et al.  A cutting plane method from analytic centers for stochastic programming , 1995, Math. Program..

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

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

[12]  Jacek Gondzio,et al.  Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..

[13]  Krzysztof C. Kiwiel,et al.  A note on some analytic center cutting plane methods for convex feasibility and minimization problems , 1996, Comput. Optim. Appl..

[14]  Patrice Marcotte,et al.  An analytic center cutting plane method for pseudomonotone variational inequalities , 1997, Oper. Res. Lett..

[15]  Krzysztof C. Kiwiel,et al.  Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization , 1997, SIAM J. Optim..

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

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

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

[19]  Jean-Philippe Vial,et al.  Shallow, deep and very deep cuts in the analytic center cutting plane method , 1999, Math. Program..