Two-Step Algorithms for Nonlinear Optimization with Structured Applications

In this paper we propose extensions to trust-region algorithms in which the classical step is augmented with a second step that we insist yields a decrease in the value of the objective function. The classical convergence theory for trust-region algorithms is adapted to this class of two-step algorithms. The algorithms can be applied to any problem with variable(s) whose contribution to the objective function is a known functional form. In the nonlinear programming package LANCELOT, they have been applied to update slack variables and variables introduced to solve minimax problems, leading to enhanced optimization efficiency. Extensive numerical results are presented to show the effectiveness of these techniques.

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

[2]  A. Conn,et al.  Circuit optimization via adjoint Lagrangians , 1997, ICCAD 1997.

[3]  P. Toint,et al.  Global convergence of a class of trust region algorithms for optimization with simple bounds , 1988 .

[4]  Jorge J. Moré,et al.  Recent Developments in Algorithms and Software for Trust Region Methods , 1982, ISMP.

[5]  Andrew R. Conn,et al.  Optimization of custom MOS circuits by transistor sizing , 1996, ICCAD 1996.

[6]  M. Powell.  CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS , 1975 .

[7]  Danny C. Sorensen,et al.  Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint , 1997, SIAM J. Optim..

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

[9]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

[10]  P. Gill,et al.  User's Guide for SOL/NPSOL: A Fortran Package for Nonlinear Programming. , 1983 .

[11]  M. Powell.  A New Algorithm for Unconstrained Optimization , 1970 .

[12]  T. Steihaug.  The Conjugate Gradient Method and Trust Regions in Large Scale Optimization , 1983 .

[13]  J. J. Moré.  Generalizations of the trust region problem , 1993 .

[14]  Ronald A. Rohrer,et al.  Piecewise approximate circuit simulation , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[16]  N. Gould,et al.  On solving three classes of nonlinear programming problems via simple differentiable penalty functions , 1988 .

[17]  Richard H. Byrd,et al.  Approximate solution of the trust region problem by minimization over two-dimensional subspaces , 1988, Math. Program..

[18]  Philip N. Strenski,et al.  Gradient-based optimization of custom circuits using a static-timing formulation , 1999, DAC '99.

[19]  S. W. Thomas.  Sequential estimation techniques for quasi-newton algorithms. , 1975 .

[20]  Ronald A. Rohrer,et al.  Sensitivity computation in piecewise approximate circuit simulation , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[22]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[23]  P. Toint,et al.  A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds , 1991 .

[24]  Andrew R. Conn,et al.  JiffyTune: circuit optimization using time-domain sensitivities , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..