Primal-dual nonlinear rescaling method with dynamic scaling parameter update

In this paper we developed a general primal-dual nonlinear rescaling method with dynamic scaling parameter update (PDNRD) for convex optimization. We proved the global convergence, established 1.5-Q-superlinear rate of convergence under the standard second order optimality conditions. The PDNRD was numerically implemented and tested on a number of nonlinear problems from COPS and CUTE sets. We present numerical results, which strongly corroborate the theory.

[1]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[2]  N. Gould.  On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions , 1986 .

[3]  Roman A. Polyak,et al.  Nonlinear rescaling vs. smoothing technique in convex optimization , 2002, Math. Program..

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

[5]  S. Nash,et al.  A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization , 1994 .

[6]  Roman A. Polyak,et al.  Log-Sigmoid Multipliers Method in Constrained Optimization , 2001, Ann. Oper. Res..

[7]  Roy E. Marsten,et al.  Computational experience with a globally convergent primal—dual predictor—corrector algorithm for linear programming , 1994, Math. Program..

[8]  David F. Shanno,et al.  Computational experience with penalty-barrier methods for nonlinear programming , 1996, Ann. Oper. Res..

[9]  Yin Zhang,et al.  Solving large-scale linear programs by interior-point methods under the Matlab ∗ Environment † , 1998 .

[10]  M. Bendsøe,et al.  Optimization methods for truss geometry and topology design , 1994 .

[11]  Anders Forsgren,et al.  Primal-Dual Interior Methods for Nonconvex Nonlinear Programming , 1998, SIAM J. Optim..

[12]  Jorge J. Moré,et al.  COPS: Large-scale nonlinearly constrained optimization problems , 2000 .

[13]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

[14]  N. Gould.  On the convegence of a sequential penalty function method for constrained minimization , 1989 .

[15]  Aaron Melman,et al.  The Newton modified barrier method for QP problems , 1996, Ann. Oper. Res..

[16]  Igor Griva,et al.  Primal-Dual Nonlinear Rescaling Method for Convex Optimization , 2004 .

[17]  Nicholas I. M. Gould,et al.  CUTE: constrained and unconstrained testing environment , 1995, TOMS.

[18]  Michael Zibulevsky,et al.  Penalty/Barrier Multiplier Methods for Convex Programming Problems , 1997, SIAM J. Optim..

[19]  Nicholas I. M. Gould,et al.  Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming , 2000, SIAM J. Optim..

[20]  Robert J. Vanderbei,et al.  Symmetric Quasidefinite Matrices , 1995, SIAM J. Optim..

[21]  Barry W. Peyton,et al.  Block sparse Cholesky algorithms on advanced uniprocessor computers , 1991 .

[22]  Yin Zhang,et al.  On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms , 1992, SIAM J. Optim..

[23]  J. Dussault,et al.  Stable exponential-penalty algorithm with superlinear convergence , 1994 .

[24]  Michael L. Overton,et al.  A Primal-dual Interior Method for Nonconvex Nonlinear Programming , 1998 .

[25]  Roberto Cominetti,et al.  Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming , 1997, Math. Oper. Res..

[26]  Roman A. Polyak,et al.  Modified barrier functions (theory and methods) , 1992, Math. Program..

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

[28]  Jean-Pierre Dussault.  Augmented penalty algorithms , 1998 .

[29]  J. Sobieszczanski-Sobieski,et al.  The Newton log-sigmoid method in constrained optimization , 1998 .

[30]  D. Bertsekas,et al.  Multiplier methods for convex programming , 1973, CDC 1973.

[31]  Marc Teboulle,et al.  Nonlinear rescaling and proximal-like methods in convex optimization , 1997, Math. Program..

[32]  Boris Polyak.  Iterative methods using lagrange multipliers for solving extremal problems with constraints of the equation type , 1970 .

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