Finding a point in the relative interior of a polyhedron

A new initialization or ‘Phase I’ strategy for feasible interior point methods for linear programming is proposed that computes a point on the primal-dual central path associated with the linear program. Provided there exist primal-dual strictly feasible points | an all-pervasive assumption in interior point method theory that implies the existence of the central path | our initial method (Algorithm 1) is globally Q-linearly and asymptotically Qquadratically convergent, with a provable worst-case iteration complexity bound. When this assumption is not met, the numerical behaviour of Algorithm 1 is highly disappointing, even when the problem is primal-dual feasible. This is due to the presence of implicit equalities, inequality constraints that hold as equalities at all the feasible points. Controlled perturbations of the inequality constraints of the primal-dual problems are introduced | geometrically equivalent to enlarging the primal-dual feasible region and then systematically contracting it back to its initial shape | in order for the perturbed problems to satisfy the assumption. Thus Algorithm 1 can successfully be employed to solve each of the perturbed problems. We show that, when there exist primal-dual strictly feasible points of the original problems, the resulting method, Algorithm 2, nds such a point in a nite number of changes to the perturbation parameters. When implicit equalities are present, but the original problem and its dual are feasible, Algorithm 2 asymptotically detects all the primal-dual implicit equalities and generates a point in the relative interior of the primal-dual feasible set. Algorithm 2 can also asymptotically detect primal-dual infeasibility. Successful numerical experience with Algorithm 2 on linear programs from NETLIB and CUTEr, both with and without any signican t preprocessing of the problems, indicates that Algorithm 2 may be used as an algorithmic preprocessor for removing implicit equalities, with theoretical guarantees of convergence.

[1]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[2]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[3]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[4]  J. Telgen.  Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints , 1983 .

[5]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[6]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[7]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[8]  M. Kojima,et al.  A primal-dual interior point algorithm for linear programming , 1988 .

[9]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[10]  Clóvis C. Gonzaga,et al.  Path-Following Methods for Linear Programming , 1992, SIAM Rev..

[11]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[12]  Kurt M. Anstreicher,et al.  On interior algorithms for linear programming with no regularity assumptions , 1992, Oper. Res. Lett..

[13]  Shinji Mizuno,et al.  A primal—dual infeasible-interior-point algorithm for linear programming , 1993, Math. Program..

[14]  Yin Zhang,et al.  On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem , 1994, SIAM J. Optim..

[15]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[16]  Michael C. Ferris,et al.  Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points , 1996, SIAM J. Optim..

[17]  Yinyu Ye,et al.  A simplified homogeneous and self-dual linear programming algorithm and its implementation , 1996, Ann. Oper. Res..

[18]  Robert M. Freund,et al.  Interior point methods : current status and future directions , 1996 .

[19]  Knud D. Andersen,et al.  The APOS linear programming solver: an implementation of the homogeneous algorithm , 1997 .

[20]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[21]  Jacek Gondzio,et al.  Presolove Analysis of Linear Programs Prior to Applying an Interior Point Method , 1997, INFORMS J. Comput..

[22]  Philippe Refalo.  Approaches to the Incremental Detection of Implicit Equalities with the Revised Simplex Method , 1998, PLILP/ALP.

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

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

[25]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[26]  ERLING D. ANDERSEN,et al.  Certificates of Primal or Dual Infeasibility in Linear Programming , 2001, Comput. Optim. Appl..

[27]  Shinji Mizuno,et al.  On two homogeneous self-dual approaches to linear programming and its extensions , 2001, Math. Program..

[28]  M. Todd.  Detecting Infeasibility in Infeasible-Interior-Point Methods for Optimization , 2003 .

[29]  Nicholas I. M. Gould,et al.  GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization , 2003, TOMS.

[30]  Nicholas I. M. Gould,et al.  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.

[31]  Gerard Sierksma,et al.  Degeneracy degrees of constraint collections , 2003, Math. Methods Oper. Res..

[32]  Michael J. Maher,et al.  On Fourier's algorithm for linear arithmetic constraints , 1992, Journal of Automated Reasoning.

[33]  Iain S. Duff,et al.  MA57---a code for the solution of sparse symmetric definite and indefinite systems , 2004, TOMS.

[34]  Michael P. Friedlander,et al.  A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints , 2005, SIAM J. Optim..

[35]  David F. Shanno,et al.  An exact primal–dual penalty method approach to warmstarting interior-point methods for linear programming , 2007, Comput. Optim. Appl..

[36]  Richard J. Caron.  Redundancy in Nonlinear Programs , 2009, Encyclopedia of Optimization.

[37]  Igor Griva,et al.  Interior-Point Methods for Linear Programming , 2009 .