Methods for nonlinear constraints in optimization calculations

[1]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[2]  R. E. Griffith,et al.  A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems , 1961 .

[3]  M. Hestenes.  Multiplier and gradient methods , 1969 .

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

[5]  R. Fletcher.  A General Quadratic Programming Algorithm , 1971 .

[6]  Roger Fletcher,et al.  An exact penalty function for nonlinear programming with inequalities , 1973, Math. Program..

[7]  D. Bertsekas.  On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[8]  Stephen M. Robinson,et al.  Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[9]  R. Rockafellar.  Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming , 1974 .

[10]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

[11]  R. Tapia.  Diagonalized multiplier methods and quasi-Newton methods for constrained optimization , 1977 .

[12]  P. Toint.  On sparse and symmetric matrix updating subject to a linear equation , 1977 .

[13]  N. Maratos,et al.  Exact penalty function algorithms for finite dimensional and control optimization problems , 1978 .

[14]  W. Murray,et al.  Projected Lagrangian Methods Based on the Trajectories of Penalty and Barrier Functions. , 1978 .

[15]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[16]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[17]  J. Dunn.  Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes , 1981 .

[18]  Andrew R. Conn,et al.  Nonlinear programming via an exact penalty function: Global analysis , 1982, Math. Program..

[19]  Margaret H. Wright,et al.  Computation of the search direction in constrained optimization algorithms , 1982 .

[20]  Andrew R. Conn,et al.  Nonlinear programming via an exact penalty function: Asymptotic analysis , 1982, Math. Program..

[21]  R. Dembo,et al.  INEXACT NEWTON METHODS , 1982 .

[22]  Michael A. Saunders,et al.  A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints , 1982 .

[23]  C. Lemaréchal,et al.  The watchdog technique for forcing convergence in algorithms for constrained optimization , 1982 .

[24]  R. Fletcher,et al.  Second order corrections for non-differentiable optimization , 1982 .

[25]  Michael J. Best,et al.  Equivalence of some quadratic programming algorithms , 1984, Math. Program..

[26]  Richard A. Tapia,et al.  A trust region strategy for nonlinear equality constrained op-timization , 1984 .

[27]  Richard H Byrd,et al.  On the convergence of constrained optimization methods with accurate Hessian information on a subspace , 1990 .

[28]  A. Vardi.  A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation , 1985 .

[29]  Robert S. Womersley,et al.  Local properties of algorithms for minimizing nonsmooth composite functions , 1985, Math. Program..

[30]  Ya-Xiang Yuan,et al.  Conditions for convergence of trust region algorithms for nonsmooth optimization , 1985, Math. Program..

[31]  Arne Drud,et al.  CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems , 1985, Math. Program..

[32]  Ya-Xiang Yuan,et al.  On the superlinear convergence of a trust region algorithm for nonsmooth optimization , 1985, Math. Program..

[33]  Richard H. Byrd,et al.  A Trust Region Algorithm for Nonlinearly Constrained Optimization , 1987 .

[34]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[35]  Ding-Zhu Du,et al.  A convergence theorem of Rosen’s gradient projection method , 1986, Math. Program..

[36]  Ya-Xiang Yuan,et al.  A recursive quadratic programming algorithm that uses differentiable exact penalty functions , 1986, Math. Program..

[37]  L. Grippo,et al.  A nonmonotone line search technique for Newton's method , 1986 .

[38]  Masao Fukushima,et al.  A successive quadratic programming algorithm with global and superlinear convergence properties , 1986, Math. Program..

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

[40]  Stephen J. Wright,et al.  Optimization Software Guide , 1987 .

[41]  P. Gill,et al.  A Schur-complement method for sparse quadratic programming , 1987 .

[42]  J. Ecker,et al.  A note on solution of nonlinear programming problems with imprecise function and gradient values , 1987 .

[43]  Paul H. Calamai,et al.  Projected gradient methods for linearly constrained problems , 1987, Math. Program..

[44]  J. Dunn.  On the convergence of projected gradient processes to singular critical points , 1987 .

[45]  Z. A. Maany,et al.  A new algorithm for highly curved constrained optimisation , 1987 .

[46]  T. Steihaug,et al.  A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization , 1987 .

[47]  M. Bartholomew-Biggs.  Recursive quadratic programming methods based on the augmented lagrangian , 1987 .

[48]  Stephen J. Wright.  Local properties of inexact methods for minimizing nonsmooth composite functions , 1987, Math. Program..

[49]  P. Toint.  Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space , 1988 .

[50]  D. M. Ryan,et al.  On the solution of highly degenerate linear programmes , 1988, Math. Program..

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

[52]  Griewank,et al.  On automatic differentiation , 1988 .

[53]  J. J. Moré,et al.  On the identification of active constraints , 1988 .

[54]  R. Fletcher.  Degeneracy in the presence of roundoff errors , 1988 .

[55]  Roger Fletcher,et al.  Nonlinear programming and nonsmooth optimization by successive linear programming , 1989, Math. Program..

[56]  P. Boggs,et al.  A strategy for global convergence in a sequential quadratic programming algorithm , 1989 .

[57]  M. J. D. Powell,et al.  A tolerant algorithm for linearly constrained optimization calculations , 1989, Math. Program..

[58]  Michael A. Saunders,et al.  A practical anti-cycling procedure for linearly constrained optimization , 1989, Math. Program..

[59]  James V. Burke,et al.  A robust sequential quadratic programming method , 1989, Math. Program..

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

[61]  A. Dax.  The Minimax Solution of Linear Equations Subject to Linear Constraints , 1989 .

[62]  Stephen J. Wright.  Convergence of SQP-like methods for constrained optimization , 1989 .

[63]  Ding-Zhu Du,et al.  Global convergence of Rosen's gradient projection method , 1989, Math. Program..

[64]  Stephen J. Wright.  An inexact algorithm for composite nondifferentiable optimization , 1989, Math. Program..

[65]  伊理 正夫,et al.  Mathematical programming : recent developments and applications , 1989 .

[66]  Gerardo Toraldo,et al.  Convergence properties of trust region methods for linear and convex constraints , 1990, Math. Program..

[67]  Thomas F. Coleman,et al.  Computing a Trust Region Step for a Penalty Function , 1990, SIAM J. Sci. Comput..

[68]  J. Z. Zhang,et al.  Projected quasi-Newton algorithm with trust region for constrained optimization , 1990 .

[69]  Ya-Xiang Yuan,et al.  On a subproblem of trust region algorithms for constrained optimization , 1990, Math. Program..

[70]  W. Hager.  Multiplier methods for nonlinear optimal control , 1990 .

[71]  R. Fontecilla.  Inexact Secant methods for nonlinear constrained optimization , 1990 .

[72]  A. Tits,et al.  Avoiding the Maratos effect by means of a nonmonotone line search I. general constrained problems , 1991 .

[73]  M. El-Alem.  A global convergence theory for the Celis-Dennis-Tapia trust-region algorithm for constrained optimization , 1991 .

[74]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

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

[76]  P T Boggs,et al.  A merit function for inequality constrained nonlinear programming problems , 1991 .

[77]  Jong-Shi Pang,et al.  A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems , 1991, Math. Program..

[78]  Ya-Xiang Yuan,et al.  A trust region algorithm for equality constrained optimization , 1990, Math. Program..

[79]  Michael A. Saunders,et al.  Inertia-Controlling Methods for General Quadratic Programming , 1991, SIAM Rev..

[80]  Jean Charles Gilbert.  Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization , 1991, Math. Program..

[81]  Jorge Nocedal,et al.  An analysis of reduced Hessian methods for constrained optimization , 1991, Math. Program..

[82]  M. Lescrenier.  Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold , 1991 .

[83]  R. Carter.  On the global convergence of trust region algorithms using inexact gradient information , 1991 .

[84]  N. Gould.  An Algorithm for Large-Scale Quadratic Programming , 1991 .

[85]  L. C. W. Dixon,et al.  On the Impact of Automatic Differentiation on the Relative Performance of Parallel Truncated Newton and Variable Metric Algorithms , 1991, SIAM J. Optim..

[86]  Francisco Facchinei,et al.  An RQP algorithm using a differentiable exact penalty function for inequality constrained problems , 1992, Math. Program..

[87]  P. Toint,et al.  Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .

[88]  Matthias Heinkenschloss.  On the solution of a two ball trust region subproblem , 1992, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[89]  Thomas F. Coleman,et al.  Partitioned quasi-Newton methods for nonlinear equality constrained optimization , 1992, Math. Program..

[90]  Yin Zhang,et al.  Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization , 1992, Math. Program..

[91]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[92]  Stuart Smith,et al.  Solving Large Sparse Nonlinear Programs Using GRG , 1992, INFORMS J. Comput..

[93]  James V. Burke,et al.  A Robust Trust Region Method for Constrained Nonlinear Programming Problems , 1992, SIAM J. Optim..

[94]  J. F. Bonnans,et al.  Avoiding the Maratos effect by means of a nonmonotone line search II. Inequality constrained problems—feasible iterates , 1992 .

[95]  Yin Zhang,et al.  An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization , 1992, SIAM J. Optim..

[96]  Nicholas I. M. Gould,et al.  Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints , 1993, SIAM J. Optim..

[97]  Jianzhon Zhang,et al.  A practical trust region method for equality constrained optimization problems , 1993 .

[98]  G. Toraldo,et al.  On the identification property of a projected gradient method , 1993 .

[99]  Laurie A. Hulbert,et al.  A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds , 1993, SIAM J. Optim..

[100]  André L. Tits,et al.  On combining feasibility, descent and superlinear convergence in inequality constrained optimization , 1993, Math. Program..

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

[102]  Jong-Shi Pang,et al.  Serial and Parallel Computation of Karush-Kuhn-Tucker Points via Nonsmooth Equations , 1994, SIAM J. Optim..

[103]  S. Lucidi,et al.  Local properties of a Newton-like direction for equality constrained minimization problems , 1994 .

[104]  Chaya Gurwitz.  Local Convergence of a Two-Piece Update of a Projected Hessian Matrix , 1994, SIAM J. Optim..

[105]  C. Lemaréchal,et al.  A Condensed Introduction to Bundle Methods in Nonsmooth Optimization , 1994 .

[106]  E. Spedicato.  Algorithms for continuous optimization : the state of the art , 1994 .

[107]  Ana Friedlander,et al.  On the Maximization of a Concave Quadratic Function with Box Constraints , 1994, SIAM J. Optim..

[108]  José Mario Martínez,et al.  On the Resolution of Linearly Constrained Convex Minimization Problems , 1994, SIAM J. Optim..

[109]  Nicholas I. M. Gould,et al.  A note on exploiting structure when using slack variables , 1994, Math. Program..

[110]  P. Spellucci,et al.  A successful implementation of the Pantoja-Mayne SQP method , 1994 .

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

[112]  James V. Burke,et al.  Exposing Constraints , 1994, SIAM J. Optim..

[113]  Robert B. Schnabel,et al.  Parallel Nonlinear Optimization: Limitations, Challenges, and Opportunities , 1994 .

[114]  Francisco J. Prieto,et al.  A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem , 1995, SIAM J. Optim..

[115]  Jorge Nocedal,et al.  A Reduced Hessian Method for Large-Scale Constrained Optimization , 1995, SIAM J. Optim..

[116]  Paul T. Boggs,et al.  Sequential Quadratic Programming , 1995, Acta Numerica.

[117]  Michael A. Saunders,et al.  A Practical Interior-Point Method for Convex Programming , 1995, SIAM J. Optim..

[118]  Jorge Nocedal,et al.  A Limited Memory Algorithm for Bound Constrained Optimization , 1995, SIAM J. Sci. Comput..

[119]  J. Frédéric Bonnans,et al.  Sequential Quadratic Programming with Penalization of the Displacement , 1995, SIAM J. Optim..

[120]  J. Dussault.  Numerical stability and efficiency of penalty algorithms , 1995 .

[121]  Mahmoud El-Alem,et al.  A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization , 1995, SIAM J. Optim..

[122]  Roger Fletcher,et al.  An Optimal Positive Definite Update for Sparse Hessian Matrices , 1995, SIAM J. Optim..

[123]  Henry Wolkowicz,et al.  Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations , 1995, SIAM J. Optim..

[124]  José Mario Martínez,et al.  A trust-region strategy for minimization on arbitrary domains , 1995, Math. Program..

[125]  Ya-Xiang Yuan,et al.  On the convergence of a new trust region algorithm , 1995 .

[126]  Annick Sartenaer,et al.  A Class of Trust Region Methods for Nonlinear Network Optimization Problems , 1995, SIAM J. Optim..

[127]  Nicholas I. M. Gould,et al.  Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints , 1996, SIAM J. Optim..

[128]  Nicholas I. M. Gould,et al.  On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds , 1997, Comput. Optim. Appl..

[129]  I. Duff,et al.  The state of the art in numerical analysis , 1997 .

[130]  John E. Dennis,et al.  A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization , 1997, SIAM J. Optim..