Numerical experience with iterative methods for equality constrained nonlinear programming problems

References

• Bodon , E. , Del Popolo , A. , Lukian , L. and Spedicato , E. Computational experiments with ABS algorithms for KKT linear systems . Optimization Methods and Software , 16 85 – 99 .
   Google Scholar
• Boggs , P.T. and Tolle , J.W. 1995 . Sequential quadratic programming . Acta Numerics , 16 : 1 – 51 .
   Google Scholar
• Bongartz , I. , Conn , A.R. , Gould , N. and Toint , P.L. 1995 . CUTE: constrained and unconstrained testing environment . ACM Transactions on Mathematical Software , 21 : 123 – 160 .
   Web of Science ®Google Scholar
• Conn , A.R. , Gould , N. and Toint , P.L. 2000 . (other ref)Trust-Region Methods , Philadelphia : SIAM .
   Google Scholar
• Curtis , A.R. , Powell , M.J.D. and Reid , J.K. 1974 . On the estimation of sparse Jacobian matrices . ZMA Journal of Applied Mathematics , 13 : 117 – 119 .
   Google Scholar
• Dembo , R.S. , Eisenstat , S.C. and Steihaug , T. 1982 . Inexact Newton methods . SZAM J. Numerical Analysis , 19 : 400 – 408 .
   Web of Science ®Google Scholar
• Dennis , J.E. and Schnabel , R.B. 1983 . Numerical Methods for Unconstrained Optimization and Nonlinear Equations , Englewood Cliffs, New Jersey : Prentice-Hall .
   Google Scholar
• Duff , I.S. , Munksgaard , M. , Nielsen , H.B. and Reid , J.K. 1979 . Direct solution of sets of linear equations whose matrix is sparse and indefinite . J. Inst. Maths. Applics. , 23 : 235 – 250 .
   Google Scholar
• Duff , IS. and Reid , J.K. 1982 . MA27-A set of Fortran subroutines for solving sparse symmetric sets of linear equations , London : HMSO . Tech. Report AERE R10533
   Google Scholar
• Fletcher , R. 1987 . Practical Methoak of Optimization , Chichester : Wiley .
   Google Scholar
• Fletcher , R. and Johnson , T. 1997 . On the stability of null-space methods for KKT systems . SZAM J. Matrix Analysis and Applications , 18 : 938 – 958 .
   Web of Science ®Google Scholar
• Freund , R.W. and Nachtigal , N.M. 1994 . A new Krylov-subspace method for symmetric indefinite linear systems , Oak Ridge : Oak Ridge National Laboratory . Report No. ORNLITM-12754
   Google Scholar
• Gill , P.E. and Murray , W. 1974 . Newton type methods for unconstrained and linearly constrained optimization . Mathematical Programming , 7 : 311 – 350 .
   Google Scholar
• Gould , N.I.M. 1985 . On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem . Mathematical Programming , 32 : 90 – 99 .
   Web of Science ®Google Scholar
• Gould , N.I.M. , Hribar , M.E. and Nocedal , J. 1998 . On the solution of equality constrained quadratic programming problems arising in optimization , Didcot, Oxfordshire, UK : Rutherford Appleton Laboratory . Technical Report RAL-TR-1998469
   Google Scholar
• Griewank , A. 2000 . “ Evaluating derivatives ” . In Principles and Techniques of Algorithmic Differentiation , Philadelphia : SIAM .
   Google Scholar
• Han , S.P. 1977 . A globally convergent method for nonlinear programming . J. Optimization Theory and Applications , 22 : 297 – 309 .
   Web of Science ®Google Scholar
• Hestenes , M.R. and Stiefel , C.M. 1964 . Methods of conjugate gradient for solving linear systems . J. Res. NBS , 49 : 409 – 436 .
   Google Scholar
• Keller , C. , Gould , N.I.M. and Wathen , A.J. 2000 . Constraint preconditioning for indefinite linear systems . SZAM J. Matrix Analysis and Applications , 21 : 1300 – 1317 .
   Web of Science ®Google Scholar
• Lalee , M. , Nocedal , J. and Plantenga , T. 1998 . On the implementation of an algorithm for large-scale equality constrained optimization . SZAM J. Optimization , 8 : 682 – 706 .
   Web of Science ®Google Scholar
• Lukšan , L. , Šiška , M. , Tüma , M, , Vlček , J. and Ramešová , N. 2000 . (other ref)UFO 2000, Interactive system for universal functional optimization , Prague : Institute of Computer Science, Academy of Sciences of the Czech Republic . Research Report No. V-826
   Google Scholar
• Lukšan , L. and Vlček , J. 1998 . Indefinitely preconditioned inexact Newton method for large sparse equality constrained nonlinear programming problems , Numerical Linear Algebra with Applications ( 5 ) : 219 – 247 .
   Google Scholar
• Lukšan , L. and Vlček , J. Conjugate gradient methods for saddle point linear systems .
   Google Scholar
• Lukšan , L. and Vlček , J. 1999 . Sparse and partially separable test problems for unconstrained and equality constrained optimization , Prague : Institute of Computer Science, Academy of Sciences of the Czech Republic . Report No. 767
   Google Scholar
• Nash , S.G. and Sofer , A. 1996 . Preconditioning reduced matrices . SIAM J. Matrix Analysis and Applications , 17 : 47 – 68 .
   Google Scholar
• Paige , C.C. and Saunders , M.A. 1975 . Solution of sparse indefinite systems of linear equations , 12 : 617 – 629 .
   Google Scholar
• Perugia , I. and Simoncini , V. 2000 . Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations . Numerical Linear Algebra with Applications , 7 : 1 – 32 .
   Google Scholar
• Ramage , A. and Wathen , A.J. 1994 . Iterative solution techniques for the Stokes and Navier-Stokes equations . Int. J. Numerical Methods in Fluids , 19 : 67 – 83 .
   Google Scholar
• Rozložn'ik , M. and Simoncini , V. 2000 . (other ref)Short-term recurrences for indefinite preconditioning of saddle point problems , ETH Zurich : SAM . Report No. SAM 200048
   Google Scholar
• Rusten , A. and Winther , A.J. 1992 . A preconditioned iterative method for saddle-point problems . SLAM J. Matrix Analysis and Applications , 13 : 887 – 904 .
   Web of Science ®Google Scholar
• Schittkowski , K. 1983 . On the convergence of a sequential quadratic programming method with an augmented Lagrangian type line search function . Math. Operationsforsch. U. Statist., Ser. Optimization , 14 : 197 – 216 . 887-904
   Google Scholar
• Stiefel , E. 1955 . Relaxationsmethoden bester Strategie zur Losung hearer Gleichungssysteme . Comm. Math. Helv. , 29 : 157 – 179 .
   Google Scholar
• Weiss , R. 1996 . Parameter-free Iterative Linear Solvers , Berlin : Akademie Verlag .
   Google Scholar