Convergence Properties of Dikin’s Affine Scaling Algorithm for Nonconvex Quadratic Minimization

We study convergence properties of Dikin’s affine scaling algorithm applied to nonconvex quadratic minimization. First, we show that the objective function value either diverges or converges Q-linearly to a limit. Using this result, we show that, in the case of box constraints, the iterates converge to a unique point satisfying first-order and weak second-order optimality conditions, assuming the objective function Hessian Q is rank dominant with respect to the principal submatrices that are maximally positive semidefinite. Such Q include matrices that are positive semidefinite or negative semidefinite or nondegenerate or have negative diagonals. Preliminary numerical experience is reported.

[1]  Takashi Tsuchiya,et al.  A simplified global convergence proof of the affine scaling algorithm , 1993, Ann. Oper. Res..

[2]  Paul Tseng,et al.  On some interior-point algorithms for nonconvex quadratic optimization , 2002, Math. Program..

[3]  Walter F. Mascarenhas,et al.  The Affine Scaling Algorithm Fails for Stepsize 0.999 , 1997, SIAM J. Optim..

[4]  Takashi Tsuchiya,et al.  Global convergence of the affine scaling methods for degenerate linear programming problems , 1991, Math. Program..

[5]  Yanhui Wang,et al.  Trust region affine scaling algorithms for linearly constrained convex and concave programs , 1998, Math. Program..

[6]  Robert J. Vanderbei,et al.  Affine-scaling for linear programs with free variables , 1989, Math. Program..

[7]  Masakazu Muramatsu,et al.  An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption , 1996, Ann. Oper. Res..

[8]  Takashi Tsuchiya,et al.  Superlinear convergence of the affine scaling algorithm , 1996, Math. Program..

[9]  Clyde L. Monma,et al.  Computational experience with a dual affine variant of Karmarkar's method for linear programming , 1987 .

[10]  Takashi Tsuchiya,et al.  Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming , 1998, SIAM J. Optim..

[11]  Earl R. Barnes,et al.  Chaotic Behavior of the Affine Scaling Algorithm for Linear Programming , 2000, SIAM J. Optim..

[12]  Y. Ye.  An extension of Karmarkar's algorithm and the trust region method for quadratic programming , 1989 .

[13]  Robert J. Vanderbei,et al.  A modification of karmarkar's linear programming algorithm , 1986, Algorithmica.

[14]  Robert J. Vanderbei,et al.  Two-thirds is sharp for affine scaling , 1993, Oper. Res. Lett..

[15]  J. F. Bonnans,et al.  The trust region affine interior point algorithm for convex and nonconvex quadratic programming , 1995 .

[16]  Takashi Tsuchiya.  Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems , 1993, Ann. Oper. Res..

[17]  Yinyu Ye,et al.  On affine scaling algorithms for nonconvex quadratic programming , 1992, Math. Program..

[18]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[19]  J. J. Moré,et al.  Algorithms for bound constrained quadratic programming problems , 1989 .

[20]  Yinyu Ye,et al.  An extension of Karmarkar's projective algorithm for convex quadratic programming , 1989, Math. Program..

[21]  Jie Sun.  A convergence analysis for a convex version of Dikin's algorithm , 1996, Ann. Oper. Res..

[22]  T. Tsuchiya,et al.  A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm , 1999 .

[23]  Earl R. Barnes,et al.  A variation on Karmarkar’s algorithm for solving linear programming problems , 1986, Math. Program..

[24]  Paul Tseng,et al.  On the convergence of the affine-scaling algorithm , 1992, Math. Program..

[25]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[26]  A. Hoffman.  On approximate solutions of systems of linear inequalities , 1952 .

[27]  Takashi Tsuchiya,et al.  Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems , 1992, Math. Oper. Res..

[28]  Paul Tseng,et al.  Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem , 1992, SIAM J. Optim..

[29]  J. Frédéric Bonnans,et al.  A Trust Region Interior Point Algorithm for Linearly Constrained Optimization , 1997, SIAM J. Optim..

[30]  Romesh Saigal,et al.  A simple proof of a primal affine scaling method , 1996, Ann. Oper. Res..

[31]  Masakazu Muramatsu,et al.  Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems , 1995, SIAM J. Optim..

[32]  Jie Sun,et al.  A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions , 1993, Math. Program..

[33]  Cornelis Roos,et al.  Convergence of the Dual Variables for the Primal Affine Scaling Method with Unit Steps in the Homogeneous Case , 1997 .