Numerical optimization: Theoretical and practical aspects

Numerical Optimization: Theoretical and Practical Aspects

Volumn , Issue , 2006, Pages 1-494

  Frederic Bonnans J ^a   Charles Gilbert, J ^b   Lemaréchal, Claude ^c   Sagastizábal, Claudia A ^b,d  

^a CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^b INRIA ROCQUENCOURT   (France)

^c INRIA RHÔNE ALPES   (France)

^d IMPA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892893448     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-35447-5     Document Type: Book

References (380)

1. I. Adler, M.G.C. Resende, and G. Veiga. An implementation of Karmarkar's algorithm for linear programming. Math. Programming, 44:297-335, 1989.
2. M. Al-Baali. Descent property and global convergence of the Fletcher-Reeves methods with inexact line search. IMA Journal of Numerical Analysis, 5:121-124, 1985.
3. W. Alt. The Lagrange-Newton method for infinite-dimensional optimization problems. Numerical Functional Analysis and Optimization, 11:201-224, 1990.
4. W. Alt. Sequential quadratic programming in Banach spaces. In W. Oettli and D. Pallaschke, editors, Advances in Optimization, number 382 in Lecture Notes in Economics and Mathematical Systems, pages 281-301. Springer- Verlag, 1992.
5. W. Alt. Semi-local convergence of the Lagrange-Newton method with application to optimal control. In R. Durier and Ch. Michelot, editors, Recent Developments in Optimization, number 429 in Lecture Notes in Economics and Mathematical Systems, pages 1-16. Springer-Verlag, 1995.
6. W. Alt and K. Malanowski. The Lagrange-Newton method for nonlinear optimal control problems. Computational Optimization and Applications, 2:77-100, 1991.
7. M. Anitescu. Degenerate nonlinear programming with a quadratic growth condition. SIAM Journal on Optimization, 10:1116-1135, 2000.
8. M. Anitescu. On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy. Mathematical Programming, 92:359-386, 2002.
9. K.M. Anstreicher and M.H. Wright. A note on the augmented Hessian when the reduced Hessian is semidefinite. SIAM Journal on Optimization, 11:243-253, 2000.
10. P. Armand and J.Ch. Gilbert. A piecewise line-search technique for maintaining the positive definiteness of the updated matrices in the SQP method. Computational Optimization and Applications, 16:121-158, 2000.
11. P. Armand, J.Ch. Gilbert, and S. Jan-Jégou. A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach. Mathematical Programming, 92:393-424, 2002.
12. L. Armijo. Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of Mathematics, 16:1-3, 1966.
13. K. Arrow, L. Hurwicz, and H. Uzawa. Studies in Nonlinear Programming. Stanford University Press, Stanford, CA, 1958.
14. K.J. Arrow and R.M. Solow. Gradient methods for constrained maxima with weakened assumptions. In K.J. Arrow, L. Hurwicz, and H. Uzawa, editors, Studies in Linear and Nonlinear Programming. Stanford University Press, Standford, Calif., 1958.
15. A. Auslender. Numerical methods for nondifferentiable convex optimization. Mathematical Programming Study, 30:102-126, 1987.
16. A. Auslender and M. Teboulle. Lagrangian duality and related multiplier methods for variational inequality problems. SIAM Journal on Optimization, 10:1097-1115, 2000.
17. A. Auslender, M. Teboulle, and S. Ben-Tiba. Interior proximal and multiplier methods based on second order homogeneous functionals. Mathematics of Operations Research, 24:645-668, 1999.
18. F. Babonneau, C. Beltran, A. Haurie, C. Tadonki, and J.-P. Vial. Proximal-ACCPM: a versatile oracle based optimization method. To appear in Computational Management Science, 2006.
19. L. Bacaud, C. Lemaréchal, A. Renaud, and C. Sagastizábal. Bundle methods in stochastic optimal power management: a disaggregated approach using preconditioners. Computational Optimization and Applications, 20(3):227-244, 2001.
20. R.E. Bank, B.D. Welfert, and H. Yserentant. A class of iterative methods for solving saddle point problems. Numerische Mathematik, 56:645-666, 1990.
21. A. Belloni, A. Diniz, M.E. Maceira, and C. Sagastizábal. Bundle relaxation and primal recovery in Unit Commitment problems. The Brazilian case. Annals of Operations Research, 120:21-44, 2003.
22. A. Belloni and C. Sagastizábal. Dynamic bundle methods: Application to combinatorial optimization. Technical report, Optimization on line, 2004. http://www.optimization-online.org/DB-HTML/2004/08/925.html.
23. A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization -Analysis, Algorithms, and Engineering Applications. MPS/SIAM Series on Optimization 2. SIAM, 2001.
24. M.W. Berry, M.T. Health, I. Kaneko, M. Lawo, R.J. Plemmons, and R.C. Ward. An algorithm to compute a sparse basis of the null space. Numerische Mathematik, 47:483-504, 1985.
25. D.P. Bertsekas. Multiplier methods: a survey. Automatica, 12:133-145, 1976.
26. D.P. Bertsekas. Constrained Optimization and Lagrange Multiplier Methods. Academic Press, 1982.
27. D.P. Bertsekas. Nonlinear Programming. Athena Scientific, 1995. Second edition, 1999.
28. J.T. Betts. Practical Methods for Optimal Control Using Nonlinear Programming. SIAM, 2001.
29. J.T. Betts and P.D. Frank. A sparse nonlinear optimization algorithm. Journal of Optimization Theory and Applications, 3:519-541, 1994.
30. L.T. Biegler, J. Nocedal, and C. Schmid. A reduced Hessian method for largescale constrained optimization. SIAM Journal on Optimization, 5:314-347,1995.
31. P.T. Boggs, A.J. Kearsley, and J.W. Tolle. A global convergence analysis of an algorithm for large-scale nonlinear optimization problems. SIAM Journal on Optimization, 9:833-862, 1999.
32. P.T. Boggs, A.J. Kearsley, and J.W. Tolle. A practical algorithm for general large scale nonlinear optimization problems. SIAM Journal on Optimization, 9:755-778, 1999.
33. P.T. Boggs and J.W. Tolle. A family of descent functions for constrained optimization. SIAM Journal on Numerical Analysis, 21:1146-1161, 1984.
34. P.T. Boggs and J.W. Tolle. A strategy for global convergence in a sequential quadratic programming algorithm. SIAM Journal on Numerical Analysis, 26:600-623, 1989.
35. P.T. Boggs and J.W. Tolle. Sequential quadratic programming. In Acta Numerica 1995, pages 1-51. Cambridge University Press, 1995.
36. P.T. Boggs, J.W. Tolle, and P. Wang. On the local convergence of quasi- Newton methods for constrained optimization. SIAM Journal on Control and Optimization, 20:161-171, 1982.
37. J.F. Bonnans. Asymptotic admissibility of the unit stepsize in exact penalty methods. SIAM Journal on Control and Optimization, 27:631-641, 1989.
38. J.F. Bonnans. Local study of Newton type algorithms for constrained problems. In S. Dolecki, editor, Optimization, number 1405 in Lecture Notes in Mathematics, pages 13-24. Springer-Verlag, 1989.
39. J.F. Bonnans. Théorie de la pénalisation exacte. Modélisation Mathématique et Analyse Numérique, 24:197-210, 1990.
40. J.F. Bonnans. Local analysis of Newton-type methods for variational inequalities and nonlinear programming. Applied Mathematics and Optimization, 29:161-186, 1994.
41. J.F. Bonnans. Exact penalization with a small nonsmooth term. Revista de Matemáticas Aplicadas, 17:37-45, 1996.
42. J.F. Bonnans, J.Ch. Gilbert, C. Lemaréchal, and C. Sagastizábal. A family of variable metric proximal methods. Mathematical Programming, 68:15-47, 1995.
43. J.F. Bonnans, J.Ch. Gilbert, C. Lemaréchal, and C. Sagastizábal. Optimisation Numérique - Aspects théoriques et pratiques. Number 27 in Mathématiques et Applications. Springer Verlag, Berlin, 1997.
44. J.F. Bonnans and C.C. Gonzaga. Convergence of interior point algorithms for the monotone linear complementarity problem. Mathematics of Operations Research, 21:1-25, 1996.
45. J.F. Bonnans and G. Launay. Sequential quadratic programming with penalization of the displacement. SIAM Journal on Optimization, 5:792-812, 1995.
46. J.F. Bonnans, E.R. Panier, A.L. Tits, and J.L. Zhou. Avoiding the Maratos effect by means of a nonmonotone line search II: Inequality constrained problems - Feasible iterates. SIAM Journal on Numerical Analysis, 29:1187-1202, 1992.
47. J.F. Bonnans, C. Pola, and R. Rebaï. Perturbed path following interior point algorithms. Optimization Methods and Software, 11-12:183-210, 1999.
48. J.F. Bonnans and F.A. Potra. Infeasible path following algorithms for linear complementarity problems. Mathematics of Operations Research, 22:378-407, 1997.
49. J.F. Bonnans and A. Shapiro. Optimization problems with perturbations - A guided tour. SIAM Review, 40:202-227, 1998.
50. J.F. Bonnans and A. Shapiro. Perturbation Analysis of Optimization Problems. Springer Verlag, New York, 2000.
51. W. Boothby. An Introduction to Differentiable Manifolds and Differential Geometry. Academic Press, New York, 1975.
52. J. Borwein and A.S. Lewis. Convex Analysis and Nonlinear Optimization. Springer Verlag, New York, 2000.
53. J.H. Bramble and J.E. Pasciak. A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems. Mathematics of Computation, 50:1-7, 1988.
54. J.H. Bramble, J.E. Pasciak, and A.T. Vassilev. Analysis of the Uzawa algorithm for saddle point problems. SIAM Journal on Numerical Analysis, 34:1072-1092, 1997.
55. U. Brännlund. On relaxation methods for nonsmooth convex optimization. PhD thesis, Royal Institute of Technology - Stockholm, 1993.
56. J.R. Bunch and L. Kaufman. Some stable methods for calculating inertia and solving symmetric linear systems. Mathematics of Computation, 31:163-179, 1977.
57. R.S. Burachik, A.N. Iusem, and B.F. Svaiter. Enlargement of monotone operators with applications to variational inequalities. Set-Valued Anal., 5(2):159-180, 1997.
58. R.S. Burachik, C. Sagastizábal, and S. Scheinberg de Makler. An inexact method of partial inverses and a parallel bundle method. Optimization Methods and Software, 21(3):385-400, 2006.
59. R.S. Burachik, C. Sagastizábal, and B. F. Svaiter. Bundle methods for maximal monotone operators. In R. Tichatschke and M. Théra, editors, Ill-posed Variational Problems and Regularization Techniques, number 477 in Lecture Notes in Economics and Mathematical Systems, pages 49-64. Springer-Verlag Berlin Heidelberg, 1999.
60. J.V. Burke. An exact penalization viewpoint of constrained optimization. SIAM Journal on Control and Optimization, 29:968-998, 1991.
61. J.V. Burke and S.-P. Han. A robust sequential quadratic programming method. Mathematical Programming, 43:277-303, 1989.
62. J.D. Buys. Dual algorithms for constrained optimization. PhD thesis, Rijksuniversiteit te Leiden, Leiden, The Netherlands, 1972.
63. R.H. Byrd. An example of irregular convergence in some constrained optimization methods that use the projected Hessian. Mathematical Programming, 32:232-237, 1985.
64. R.H. Byrd. On the convergence of constrained optimization methods with accurate Hessian information on a subspace. SIAM Journal on Numerical Analysis, 27:141-153, 1990.
65. R.H. Byrd, J.Ch. Gilbert, and J. Nocedal. A trust region method based on interior point techniques for nonlinear programming. Mathematical Programming, 89:149-185, 2000.
66. R.H. Byrd and J. Nocedal. A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM Journal on Numerical Analysis, 26:727-739, 1989.
67. R.H. Byrd and J. Nocedal. An analysis of reduced Hessian methods for constrained optimization. Mathematical Programming, 49:285-323, 1991.
68. R.H. Byrd and R.B. Schnabel. Continuity of the null space basis and constrained optimization. Mathematical Programming, 35:32-41, 1986.
69. R.H. Byrd, R.A. Tapia, and Y. Zhang. An SQP augmented Lagrangian BFGS algorithm for constrained optimization. SIAM Journal on Optimization, 2:210-241, 1992.
70. A. Cauchy. Méthode générale pour la résolution des systèmes d'équations simultanées. C. R. Acad. Sci. Paris, 25:535-538, 1847.
71. J. Céa. Optimisation: Théorie et Algorithmes. Dunod, Paris, 1971.
72. Y. Chabrillac and J.-P. Crouzeix. Definiteness and semidefiniteness of quadratic forms revisited. Linear Algebra and its Applications, 63:283-292, 1984.
73. R.M. Chamberlain, C. Lemaréchal, H.C. Pedersen, and M.J.D. Powell. The watchdog technique for forcing convergence in algorithms for constrained optimization. Mathematical Programming Study, 16:1-17, 1982.
74. C. Charalambous. A lower bound for the controlling parameters of the exact penalty functions. Mathematical Programming, 15:278-290, 1978.
75. L. Chauvier, A. Fuduli, and J.Ch. Gilbert. A truncated SQP algorithm for solving nonconvex equality constrained optimization problems. In G. Di Pillo and A. Murli, editors, High Performance Algorithms and Software for Nonlinear Optimization, pages 146-173. Kluwer Academic Publishers B.V., 2003.
76. G. Chen and M. Teboulle. A proximal-based decomposition method for convex minimization problems. Math. Programming, 64(1, Ser. A):81-101, 1994.
77. X. Chen and M. Fukushima. Proximal quasi-Newton methods for nondifferentiable convex optimization. Math. Program., 85(2, Ser. A):313-334, 1999.
78. E. Cheney and A. Goldstein. Newton's method for convex programming and Tchebycheff approximations. Numerische Mathematik, 1:253-268, 1959.
79. P.G. Ciarlet. Introduction à l'Analyse Numérique Matricielle et à l'Optimisation (second edition). Masson, Paris, 1988.
80. F.H. Clarke. Optimization and Nonsmooth Analysis. John Wiley & Sons, New York; reprinted by SIAM, 1983.
81. T.F. Coleman and A.R. Conn. Nonlinear programming via an exact penalty function: asymptotic analysis. Mathematical Programming, 24:123-136, 1982.
82. T.F. Coleman and A.R. Conn. Nonlinear programming via an exact penalty function: global analysis. Mathematical Programming, 24:137-161, 1982.
83. T.F. Coleman and D.C. Sorensen. A note on the computation of an orthonormal basis for the null space of a matrix. Mathematical Programming, 29:234-242, 1984.
84. L. Conlon. Differentiable Manifolds - A first Course. Birkhauser, Boston, 1993.
85. A.R. Conn, N.I.M. Gould, and Ph.L. Toint. LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A). Number 17 in Computational Mathematics. Springer Verlag, Berlin, 1992.
86. A.R. Conn, N.I.M. Gould, and Ph.L. Toint. Trust-Region Methods. MPS/SIAM Series on Optimization. MPS/SIAM, Philadelphia, 2000.
87. D. Coppersmith and S. Winograd. On the asymptotic complexity of matrix multiplications. SIAM J. Computation, 11:472-492, 1982.
88. G. Corliss and A. Griewank, editors. Automatic Differentiation of Algorithms: Theory, Implementation, and Application. Proceedings in Applied Mathematics 53. SIAM, Philadelphia, 1991.
89. R. Correa and C. Lemaréchal. Convergence of some algorithms for convex minimization. Mathematical Programming, 62:261-275, 1993.
90. R.W. Cottle. Manifestations of the Schur complement. Linear Algebra and its Applications, 8:189-211, 1974.
91. R.W. Cottle, J.S. Pang, and R.E. Stone. The linear complementarity problem. Academic Press, New York, 1992.
92. M. Cui. A suffcient condition for the convergence of the inexact Uzawa algorithm for saddle point problems. Journal of Computational and Applied Mathematics, 139:189-196, 2002.
93. J.-C. Culioli and G. Cohen. Decomposition/coordination algorithms in stochastic optimization. SIAM J. Control Optim., 28(6):1372-1403, 1990.
94. G.B. Dantzig. Linear programming and extensions. Princeton University Press, Princeton, N.J., 1963.
95. G.B. Dantzig and P. Wolfe. The decomposition algorithm for linear programming. Econometrica, 29(4):767-778, 1961.
96. W.C. Davidon. Variable metric methods for minimization. AEC Research and Development Report ANL-5990, Argonne National Laboratory, Argonne, Illinois, 1959.
97. W.C. Davidon. Variable metric method for optimization. SIAM Journal on Optimization, 1:1-17, 1991.
98. F. Delbos and J.Ch. Gilbert. Global linear convergence of an augmented Lagrangian algorithm for solving convex quadratic optimization problems. Journal of Convex Analysis, 12:45-69, 2005.
99. F. Delbos, J.Ch. Gilbert, R. Glowinski, and D. Sinoquet. Constrained optimization in seismic reection tomography: a Gauss-Newton augmented Lagrangian approach. Geophysical Journal International, 164:670-684, 2006.
100. F. Delprat-Jannaud and P. Lailly. What information on the Earth model do reection travel times hold ? Journal of Geophysical Research, 97:19827-19844, 1992.
101. F. Delprat-Jannaud and P. Lailly. Ill-posed and well-posed formulations of the reection travel time tomography problem. Journal of Geophysical Research, 98:6589-6605, 1993.
102. R.S. Dembo and T. Steihaug. Truncated-Newton algorithms for large-scale unconstrained optimization. Mathematical Programming, 26:190-212, 1983.
103. D. den Hertog. Interior-point approach to linear, quadratic and convex programming. Kluwer Academic Publishers, Boston, 1994.
104. J.E. Dennis and J.J. Moré. A characterization of superlinear convergence and its application to quasi-Newton methods. Mathematics of Computation, 28:549-560, 1974.
105. J.E. Dennis and J.J. Moré. Quasi-Newton methods, motivation and theory. SIAM Review, 19:46-89, 1977.
106. J.E. Dennis and R.B. Schnabel. A new derivation of symmetric positive definite secant updates. In Nonlinear Programming 4, pages 167-199. Academic Press, 1981.
107. J.E. Dennis and R.B. Schnabel. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs, 1983.
108. P. Deuhard. Newton Methods for Nonlinear Problems - Affine Invariance and Adaptative Algorithms. Number 35 in Computational Mathematics. Springer, Berlin, 2004.
109. G. Di Pillo and L. Grippo. A new class of augmented Lagrangians in nonlinear programming. SIAM Journal on Control and Optimization, 17:618-628, 1979.
110. G. Di Pillo and S. Lucidi. On exact augmented Lagrangian functions in nonlinear programming. In G. Di Pillo and F. Giannessi, editors, Nonlinear Optimization and Applications, pages 85-100. Plenum Press, New York, 1996.
111. G. Di Pillo and S. Lucidi. An augmented Lagrangian function with improved exactness properties. SIAM Journal on Optimization, 12:376-406, 2001.
112. M.P. do Carmo. Riemannian Geometry. Birkhauser, Boston, 1993.
113. E.D. Dolan and J.J. Moré. Benchmarking optimization software with performance profiles. Mathematical Programming, 91:201-213, 2002.
114. I.S. Duff and J.K. Reid. MA27 - A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Technical Report AERE R10533, HMSO, London, 1982.
115. I.S. Duff and J.K. Reid. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Transactions on Mathematical Software, 9:301-325, 1983.
116. I.S. Duff and J.K. Reid. Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems. ACM Transactions on Mathematical Software, 22:227-257, 1996.
117. I. Ekeland and R. Temam. Analyse convexe et problèmes variationnels. Dunod-Gauthier Villars, Paris, 1974.
118. H.C. Elman and G.H. Golub. Inexact and preconditioned Uzawa algorithms for saddle point problems. SIAM Journal on Numerical Analysis, 31:1645-1661, 1994.
119. I.I. Eremin. The penalty method in convex programming. Soviet Mathematics Doklady, 8:459-462, 1966.
120. F. Facchinei. Exact penalty functions and Lagrange multipliers. Optimization, 22:579-606, 1991.
121. F. Facchinei and S. Lucidi. Convergence to second-order stationary points in inequality constrained optimization. Mathematics of Operations Research, 23:746-766, 1998.
122. A.V. Fiacco and G.P. McCormick. Nonlinear Programming: sequential unconstrained minimization technique. J. Wiley, New York, 1968.
123. P. Finsler. Über das vorkommen definiter und semidefiniter formen und scharen quadratischer formen. Commentarii Mathematici Helvetica, 9:188-192, 1937.
124. R. Fletcher. A class of methods for nonlinear programming with termination and convergence properties. In J. Abadie, editor, Integer and Nonlinear Programming. North-Holland, Amsterdam, 1970.
125. R. Fletcher. A FORTRAN subroutine for quadratic programming. Report R 6370, Atomic Energy Research Establishment, Harwell, England, 1970.
126. R. Fletcher. A model algorithm for composite nondifferentiable optimization problems. Mathematical Programming Study, 17:67-76, 1982.
127. R. Fletcher. Second order corrections for non-differentiable optimization. In D. Griffiths, editor, Numerical Analysis, pages 85-114. Springer-Verlag, 1982.
128. R. Fletcher. Practical Methods of Optimization (second edition). John Wiley & Sons, Chichester, 1987.
129. R. Fletcher and T. Johnson. On the stability of null-space methods for KKT systems. SIAM Journal on Matrix Analysis and Applications, 18:938-958, 1997.
130. R. Fletcher and S. Leyffer. Nonlinear programming without a penalty function. Mathematical Programming, 91:239-269, 2002.
131. R. Fletcher and S. Leyffer. A bundle filter method for nonsmooth nonlinear optimization. Technical report, University of Dundee Numerical Analysis Report NA 195, December, 1999. http://www-unix.mcs.anl.gov/~leyffer/ papers/nsfilter.pdf.
132. R. Fletcher and M.J.D. Powell. A rapidly convergent descent method for minimization. The Computer Journal, 6:163-168, 1963.
133. A. Forsgren, P.E. Gill, and W. Murray. Computing modiéd Newton directions using a partial Cholesky factorization. SIAM Journal on Scientific Computing, 16:139-150, 1995.
134. M. Fortin and R. Glowinski. Méthodes de Lagrangien Augmenté - Applications à la Résolution Numérique de Problémes aux Limites. Number 9 in Méthodes Mathématiques de l'Informatique. Dunod, Paris, 1982.
135. A. Frangioni. Generalized bundle methods. SIAM Journal on Optimization, 13(1):117-156, 2003.
136. M. Fukushima. A descent algorithm for nonsmooth convex optimization. Mathematical Programming, 30:163-175, 1984.
137. D. Gabay. Minimizing a differentiable function over a differential manifold. Journal of Optimization Theory and Applications, 37:177-219, 1982.
138. D. Gabay. Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization. Mathematical Programming Study, 16:18-44, 1982.
139. Gauss. Theoria motus corporum coelestium. F. Perthes and I.H. Besser, Hamburg, 1809.
140. J. Gauvin. A necessary and suffcient regularity condition to have bounded multipliers in nonconvex programming. Mathematical Programming, 12:136-138, 1977.
141. J. Gauvin. Théorie de la programmation mathématique non convexe. Les Publications CRM, Montréal, 1992.
142. J. Gauvin. Lecons de Programmation Mathématique. Éditions de l'École Polytechnique de Montréal, Montréal, 1995.
143. D.M. Gay, M.L. Overton, and M.H. Wright. A primal-dual interior method for nonconvex nonlinear programming. In Y.-X. Yuan, editor, Advances in Nonlinear Programming. Kluwer Academic Publishers, 1998.
144. J.Ch. Gilbert. Mise à jour de la métrique dans les méthodes de quasi- Newton réduites en optimisation avec contraintes d'égalité. Modélisation Mathématique et Analyse Numérique, 22:251-288, 1988.
145. J.Ch. Gilbert. On the local and global convergence of a reduced quasi-Newton method. Optimization, 20:421-450, 1989.
146. J.Ch. Gilbert. Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization. Mathematical Programming, 50:1-28, 1991.
147. J.Ch. Gilbert. Superlinear convergence of a reduced BFGS method with piecewise line-search and update criterion. Rapport de Recherche 2140, INRIA, BP 105, 78153 Le Chesnay, France, 1993.
148. J.Ch. Gilbert. On the realization of the Wolfe conditions in reduced quasi- Newton methods for equality constrained optimization. SIAM Journal on Optimization, 7:780-813, 1997.
149. J.Ch. Gilbert. Piecewise line-search techniques for constrained minimization by quasi-Newton algorithms. In Y.-X. Yuan, editor, Advances in Nonlinear Programming, chapter 4, pages 73-103. Kluwer Academic Publishers, 1998.
150. J.Ch. Gilbert. Éléments d'Optimisation Diffé rentiable - Théorie et Algorithmes. 2006. http://www-rocq.inria.fr/ ~gilbert/ensta/optim.html.
151. J.Ch. Gilbert, G. Le Vey, and J. Masse. La différentiation automatique de fonctions représentées par des programmes. Rapport de Recherche no 1557, Inria, BP 105, F-78153 Le Chesnay, France, 1991.
152. J.Ch. Gilbert and C. Lemaréchal. Some numerical experiments with variablestorage quasi-Newton algorithms. Mathematical Programming, 45:407-435, 1989.
153. J.Ch. Gilbert and J. Nocedal. Global convergence properties of conjugate gradient methods for optimization. SIAM Journal on Optimization, 2:21-42, 1992.
154. P.E. Gill and W. Murray. Newton-type methods for unconstrained and linearly constrained optimization. Mathematical Programming, 7:311-350, 1974.
155. P.E. Gill, W. Murray, and M.A. Saunders. SNOPT: an SQP algorithm for large-scale constrained optimization. Numerical Analysis Report 96-2, Department of Mathematics, University of California, San Diego, La Jolla, CA, 1996.
156. P.E. Gill, W. Murray, and M.A. Saunders. SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Journal on Optimization, 12:979-1006, 2002.
157. P.E. Gill, W. Murray, M.A. Saunders, G.W. Stewart, and M.H. Wright. Properties of a representation of a basis for the null space. Mathematical Programming, 33:172-186, 1985.
158. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright. User's guide for NPSOL (version 4.0): a Fortran package for nonlinear programming. Technical Report SOL-86-2, Department of Operations Research, Stanford University, Stanford, CA 94305, 1986.
159. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright. Constrained nonlinear programming. In G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, editors, Handbooks in Operations Research and Management Science, volume 1: Optimization, chapter 3, pages 171-210. Elsevier Science Publishers B.V., North-Holland, 1989.
160. P.E. Gill, W. Murray, and M.H. Wright. Practical Optimization. Academic Press, New York, 1981.
161. S.T. Glad. Properties of updating methods for the multipliers in augmented Lagrangians. Journal of Optimization Theory and Applications, 28:135-156, 1979.
162. R. Glowinski and Q.-H. Tran. Constrained optimization in reexion tomography: the augmented Lagrangian method. East-West J. Numer. Math., 1(3):213-234, 1993.
163. J.-L. Goffin. On convergence rates of subgradient optimization methods. Mathematical Programming, 13:329-347, 1977.
164. J.L. Goffin and K.C. Kiwiel. Convergence of a simple sugradient level method. Math. Program., 85:207-211, 1999.
165. D. Goldfarb and A. Idnani. A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming, 27:1-33, 1983.
166. D. Goldfarb and M.J. Todd. Linear programming. In G.L. Nemhauser et al., editor, Handbook on Operations Research and Management Science, volume 1, Optimization, pages 73-170. North-Holland, 1989.
167. A.J. Goldman and A.W. Tucker. Polyhedral convex cones. In H.W. Kuhn and A.W. Tucker, editors, Linear inequalities and related systems, pages 19- 40, Princeton, 1956. Princeton University Press.
168. A.A. Goldstein and J.F. Price. An effective algorithm for minimization. Numerische Mathematik, 10:184-189, 1967.
169. E.G. Gol'shteǐn and N.V. Tretyakov. Modiéd Lagrangians and Monotone Maps in Optimization. Discrete Mathematics and Optimization. John Wiley & Sons, New York, 1996.
170. G.H. Golub and C.F. Van Loan. Matrix Computations (second edition). The Johns Hopkins University Press, Baltimore, Maryland, 1989.
171. C.C. Gonzaga. Polynomial affine algorithms for linear programming. Math. Programming, 49:7-21, 1990.
172. C.C. Gonzaga. Path following methods for linear programming. SIAM Review, 34:167-227, 1992.
173. C.C. Gonzaga. A simple presentation of Karmarkar's algorithm. In Workshop on interior point methods, Budapest, 1993.
174. C.C. Gonzaga. The largest step path following algorithm for monotone linear complementarity problems. Mathematical Programming, 76:309-332, 1997.
175. C.C. Gonzaga and J.F. Bonnans. Fast convergence of the simpliéd largest step path following algorithm. Mathematical Programming series B, 76:95-115, 1997.
176. C.C. Gonzaga and R.A. Tapia. On the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set. SIAM J. Optimization, 7:47-65, 1997.
177. J. Goodman. Newton's method for constrained optimization. Mathematical Programming, 33:162-171, 1985.
178. N. Gould, D. Orban, and Ph.L. Toint. Numerical methods for large-scale nonlinear optimization. In Acta Numerica 2005, pages 299-361. Cambridge University Press, 2005.
179. N.I.M. Gould. On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem. Mathematical Programming, 32:90-99, 1985.
180. G. Gramlich, R. Hettich, and E.W. Sachs. Local convergence of SQP methods in semi-infinite programming. SIAM Journal on Optimization, 5:641-658, 1995.
181. A. Griewank. Evaluating Derivatives - Principles and Techniques of Algorithmic Differentiation. SIAM Publication, 2000.
182. C.B. Gurwitz. Local convergence of a two-piece update of a projected Hessian matrix. SIAM Journal on Optimization, 4:461-485, 1994.
183. W.W. Hager. Stabilized sequential quadratic programming. Computational Optimization and Applications, 12:253-273, 1999.
184. S.-P. Han. Superlinearly convergent variable metric algorithms for general nonlinear programming problems. Mathematical Programming, 11:263-282, 1976.
185. S.-P. Han. A globally convergent method for nonlinear programming. Journal of Optimization Theory and Applications, 22:297-309, 1977.
186. S.-P. Han and O.L. Mangasarian. Exact penalty functions in nonlinear programming. Mathematical Programming, 17:251-269, 1979.
187. P.C. Hansen. Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM, Philadelphia, 1998.
188. M. Held and R. Karp. The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1(1):6-25, 1971.
189. J. Herskovits. A view on nonlinear optimization. In J. Herskovits, editor, Advances in Structural Optimization, pages 71-116. Kluwer Academic Publishers, 1995.
190. J. Herskovits. Feasible direction interior-point technique for nonlinear optimization. Journal of Optimization Theory and Applications, 99:121-146, 1998.
191. M.R. Hestenes. Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4:303-320, 1969.
192. M.R. Hestenes. Conjugate Direction Methods in Optimization. Number 12 in Applications of Mathematics. Springer-Verlag, 1980.
193. M.R. Hestenes and E. Stiefel. Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards, 49:409-436, 1952.
194. N.J. Higham. Accuracy and Stability of Numerical Algorithms (second edition). SIAM Publication, Philadelphia, 2002.
195. J.-B. Hiriart-Urruty and C. Lemaréchal. Convex Analysis and Minimization Algorithms. Number 305-306 in Grundlehren der mathematischen Wissenschaften. Springer-Verlag, Berlin, 1993.
196. J.-B. Hiriart-Urruty and C. Lemaréchal. Fundamentals of Convex Analysis. Springer-Verlag, Berlin, 2001. Abridged version of Convex analysis and minimization algorithms. I and II [Springer, Berlin, 1993].
197. W. Hoyer. Variants of the reduced Newton method for nonlinear equality constrained optimization problems. Optimization, 17:757-774, 1986.
198. A.D. Ioé. Necessary and suffcient conditions for a local minimum. 1: a reduction theorem and first order conditions. SIAM Journal on Control and Optimization, 17:245-250, 1979.
199. B. Jansen, C. Roos, and T. Terlaky. The theory of linear programming: skew symmetric self-dual problems and the central path. Optimization, 29:225-233, 1994.
200. A.H.G. Rinnooy Kan and G.T. Timmer. Global optimization. In G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, editors, Handbooks in Operations Research and Management Science, volume 1: Optimization, chapter 9, pages 631-662. Elsevier Science Publishers B.V., North-Holland, 1989.
201. S. Kaniel and A. Dax. A modiéd Newton's method for unconstrained minimization. SIAM Journal on Numerical Analysis, 16:324-331, 1979.
202. L.V. Kantorovich and G.P. Akilov. Functional Analysis (second edition). Pergamon Press, London, 1982.
203. E. Karas, A. Ribeiro, C. Sagastizábal, and M.V. Solodov. A bundle-filter method for nonsmooth convex constrained optimization. Math. Program. Ser. B, 2006. Accepted for publication.
204. N. Karmarkar. A new polynomial time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
205. J. E. Kelley. The cutting plane method for solving convex programs. J. Soc. Indust. Appl. Math., 8:703-712, 1960.
206. L. Khachian. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191-194, 1979.
207. L.G. Khachiyan. A polynomial algorithm in linear programming. Doklady Adad. Nauk SSSR, 244:1093-1096, 1979.
208. Trad. anglaise : Soviet Math. Doklady 20(1979), 191-194.
209. K.V. Kim, Yu.E. Nesterov, and B.V. Cherkasskiǐ. An estimate of the effort in computing the gradient. Soviet Math. Dokl., 29:384-387, 1984.
210. K.C. Kiwiel. An exact penalty function algorithm for nonsmooth convex
211. K.C. Kiwiel. Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics 1133. Springer Verlag, Berlin, 1985.
212. K.C. Kiwiel. A constraint linearization method for nondifferentiable convex minimization. Numerische Mathematik, 51:395-414, 1987.
213. K.C. Kiwiel. A subgradient selection method for minimizing convex functions subject to linear constraints. Computing, 39(4):293-305, 1987.
214. K.C. Kiwiel. Proximity control in bundle methods for convex nondifferentiable minimization. Mathematical Programming, 46(1):105-122, 1990.
215. K.C. Kiwiel. Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math. Programming, 52(2, Ser. B):285-302, 1991.
216. K.C. Kiwiel, T. Larsson, and P.O. Lindberg. The efficiency of ballstep subgradient level methods for convex optimization. Mathematics of Operations Research, 24(1):237-254, 1999.
217. V. Klee and G.L. Minty. How good is the simplex algorithm ? In O. Shisha, editor, Inequalities III, pages 159-175. Academic Press, New York, 1972.
218. M. Kojima, N. Megiddo, T. Noma, and A. Yoshise. A uniéd approach to interior point algorithms for linear complementarity problems. Number 538 in Lecture Notes in Computer Science. Springer Verlag, Berlin, 1991.
219. K. Kortanek and Z. Jishan. New purification algorithms for linear programming. Naval Research Logistics, 35:571-583, 1988.
220. F.-S. Kupfer. An infinite-dimensional convergence theory for reduced SQP methods in Hilbert space. SIAM Journal on Optimization, 6:126-163, 1996.
221. J. Kyparisis. On uniqueness of Kuhn-Tucker multipliers in nonlinear programming. Mathematical Programming, 32:242-246, 1985.
222. L. Lasdon. Optimization Theory for Large Systems. Macmillan Series in Operations Research, 1970.
223. C.T. Lawrence and A.L. Tits. Nonlinear equality constraints in feasible sequential quadratic programming. Optimization Methods and Software, 6:265-282, 1996.
224. C.T. Lawrence and A.L. Tits. Feasible sequential quadratic programming for finely discretized problems from SIP. In R. Reemtsen and J.-J. Rückmann, editors, Semi-infinite Programming, pages 159-193. Kluwer Academic Publishers B.V., 1998.
225. C.T. Lawrence and A.L. Tits. A computationally efficient feasible sequential quadratic programming algorithm. SIAM Journal on Optimization, 11:1092-1118, 2001.
226. F. Leibfritz and E.W. Sachs. Inexact SQP interior point methods and large scale optimal control problems. SIAM Journal on Optimization, 38:272-293, 1999.
227. C. Lemaréchal. An algorithm for minimizing convex functions. In J.L. Rosenfeld, editor, Information Processing '74, pages 552-556. North Holland, 1974.
228. C. Lemaréchal. An extension of Davidon methods to nondifferentiable problems. Mathematical Programming Study, 3:95-109, 1975.
229. C. Lemaréchal. A view of line-searches. In A. Auslender, W. Oettli, and J. Stoer, editors, Optimization and Optimal Control, number 30 in Lecture Notes in Control and Information Science, pages 59-78. Springer-Verlag, Heidelberg, 1981.
230. C. Lemaréchal and R. Mifflin. Global and superlinear convergence of an algorithm for one-dimensional minimzation of convex functions. Mathematical Programming, 24:241-256, 1982.
231. C. Lemaréchal, A.S. Nemirovskii, and Yu.E. Nesterov. New variants of bundle methods. Mathematical Programming, 69:111-148, 1995.
232. C. Lemaréchal, F. Oustry, and C. Sagastizábal. The U-Lagrangian of a convex function. Transactions of the AMS, 352(2):711-729, 2000.
233. C. Lemaréchal, F. Pellegrino, A. Renaud, and C. Sagastizábal. Bundle methods applied to the unit-commitment problem. In J. Dolezal and J. Fidler, editors, System Modelling and Optimization, pages 395-402. Chapman and Hall, 1996.
234. C. Lemaréchal and C. Sagastizábal. An approach to variable metric bundle methods. In J. Henry and J-P. Yvon, editors, Systems Modelling and Optimization, number 197 in Lecture Notes in Control and Information Sciences, pages 144-162. Springer Verlag, 1994.
235. C. Lemaréchal and C. Sagastizábal. More than first-order developments of convex functions: primal-dual relations. Journal of Convex Analysis, 3(2):1-14, 1996.
236. C. Lemaréchal and C. Sagastizábal. Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIAM Journal on Optimization, 7(2):367-385, 1997.
237. C. Lemaréchal and C. Sagastizábal. Variable metric bundle methods: from conceptual to implementable forms. Mathematical Programming, 76(3):393-410, 1997.
238. K. Levenberg. A method for the solution of certain nonlinear problems in least squares. Quart. Appl. Math., 2:164-168, 1944.
239. D.C. Liu and J. Nocedal. On the limited memory BFGS method for large scale optimization. Mathematical Programming, 45:503-520, 1989.
240. D.G. Luenberger. Introduction to Linear and Nonlinear Programming (second edition). Addison-Wesley, Reading, USA, 1984.
241. L. Lukšan and J. Vlček. A bundle-Newton method for nonsmooth unconstrained minimization. Math. Programming, 83(3, Ser. A):373-391, 1998.
242. L. Lukšan and J. Vlček. Globally convergent variable metric method for convex nonsmooth unconstrained minimization. J. Optim. Theory Appl., 102(3):593-613, 1999.
243. Z.-Q. Luo, J.-S. Pang, and D. Ralph. Mathematical Programs with Equilibrium Constraints. Cambridge University Press, 1996.
244. Y. Maday, D. Meiron, A.T. Patera, and E.M. Ronquist. Analysis of iterative methods for the steady and unsteady Stokes problem: application to spectral element discretizations. SIAM Journal on Scientific Computing, 14:310-337, 1993.
245. J.H. Maddocks. Restricted quadratic forms, inertia theorems, and the Schur complement. Linear Algebra and its Applications, 108:1-36, 1988.
246. Ph. Mahey, S. Oualibouch, and Pham Dinh Tao. Proximal decomposition on the graph of a maximal monotone operator. SIAM J. Optim., 5(2):454-466, 1995.
247. O.L. Mangasarian and S. Fromovitz. The Fritz John necessary optimality conditions in the presence of equality and inequality constraints. Journal of Mathematical Analysis and Applications, 17:37-47, 1967.
248. N. Maratos. Exact penalty function algorithms for finite dimensional and control optimization problems. PhD thesis, Imperial College, London, 1978.
249. D.W. Marquardt. An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Indust. Appl. Math., 11:431-441, 1963.
250. Mathworks. The Matlab distributed computing engine. http://www.mathworks. com/.
251. D.Q. Mayne and E. Polak. A superlinearly convergent algorithm for constrained optimization problems. Mathematical Programming Study, 16:45-61, 1982.
252. K.A. McShane. A superlinearly convergent O(pnL) iteration interior-point algorithms for linear programming and the monotone linear complementarity problem. SIAM J. Optimization, 4:247-261, 1994.
253. R. Mifflin. An algorithm for constrained optimization with semi-smooth functions.
254. Mathematics of Operations Research, 2(2):191-207, 1977.
255. R. Mifflin. A modification and an extension of Lemaréchal's algorithm for nonsmooth minimization. Mathematical Programming Study, 17:77-90, 1982.
256. R. Mifflin. A quasi-second-order proximal bundle algorithm. Mathematical Programming, 73(1):51-72, 1996.
257. R. Mifflin and C. Sagastizábal. Proximal points are on the fast track. Journal of Convex Analysis, 9(2):563-579, 2002.
258. R. Mifflin and C. Sagastizábal. Primal-Dual Gradient Structured Functions: second-order results; links to epi-derivatives and partly smooth functions. SIAM Journal on Optimization, 13(4):1174-1194, 2003.
259. R. Mifflin and C. Sagastizábal. A VU-proximal point algorithm for minimization. Math. Program., 104(2-3):583-608, 2005.
260. R. Mifflin, D.F. Sun, and L.Q. Qi. Quasi-Newton bundle-type methods for nondifferentiable convex optimization. SIAM Journal on Optimization, 8(2):583-603, 1998.
261. S. Mizuno. A new polynomial time method for a linear complementarity problem. Mathematical Programming, 56:31-43, 1992.
262. S. Mizuno. A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition. Mathematics of Operations Research, 21:382-400, 1996.
263. S. Mizuno, F. Jarre, and J. Stoer. A uniéd approach to infeasible-interiorpoint algorithms via geometrical linear complementarity problems. J. Applied Mathematics and Optimization, 33:315-341, 1994.
264. S. Mizuno, M.J. Todd, and Y. Ye. On adaptative step primal-dual interiorpoint algorithms for linear programming. Mathematics of Operations Research, 18:964-981, 1993.
265. R.D.C. Monteiro and T. Tsuchiya. Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem. Mathematics of Operations Research, 21:793-814, 1996.
266. J.J. Moré. Recent developments in algorithms and software for trust region methods. In A. Bachem, M. Grötschel, and B. Korte, editors, Mathematical Programming, the State of the Art, pages 258-287. Springer-Verlag, Berlin, 1983.
267. J.J. Moré and D.J. Thuente. Line search algorithms with guaranteed suffcient decrease. ACM Transactions on Mathematical Software, 20:286-307, 1994.
268. J.J. Moré and G. Toraldo. Algorithms for bound constrained quadratic programming problems. Numerische Mathematik, 55:377-400, 1989.
269. J.J. Moré and S.J. Wright, editors. Optimization Software Guide, volume 14 of Frontiers in Applied Mathematics. SIAM Publications, 1993.
270. J.J. Moreau. Proximité et dualité dans un espace hilbertien. Bulletin de la Société Mathématique de France, 93:273-299, 1965.
271. W. Murray and M. L. Overton. Steplength algorithms for minimizing a class of nondifferentiable functions. Computing, 23(4):309-331, 1979.
272. W. Murray and F.J. Prieto. A sequential quadratic programming algorithm using an incomplete solution of the subproblem. SIAM Journal on Optimization, 5:590-640, 1995.
273. W. Murray and M.H. Wright. Projected Lagrangian methods based on the trajectories of penalty and barrier functions. Technical Report SOL-78-23, Department of Operations Research, Stanford University, Stanford, CA 94305, 1978.
274. A.S. Nemirovskii and D. Yudin. Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics, 1983. (Original Russian: Nauka, 1979).
275. Y.E. Nesterov and A.S. Nemirovskii. Interior-Point Polynomial Algorithms in Convex Programming. Number 13 in SIAM Studies in Applied Mathematics. SIAM, Philadelphia, 1994.
276. J. Von Neumann and O. Morgenstein. Theory of games and economic behavior. Princeton University Press, Princeton, 1944.
277. J. Nocedal. Updating quasi-Newton matrices with limited storage. Mathematics of Computation, 35:773-782, 1980.
278. J. Nocedal and M.L. Overton. Projected Hessian updating algorithms for nonlinearly constrained optimization. SIAM Journal on Numerical Analysis, 22:821-850, 1985.
279. J. Nocedal and S.J. Wright. Numerical Optimization. Springer Series in Operations Research. Springer, New York, 1999.
280. J.M. Ortega and W.C. Rheinboldt. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970.
281. A. Ouorou. Epsilon-proximal decomposition method. Math. Program., 99(1, Ser. A):89-108, 2004.
282. U.M. Garcia Palomares and O.L. Mangasarian. Superlinear convergent quasi-Newton algorithms for nonlinearly constrained optimization problems. Mathematical Programming, 11:1-13, 1976.
283. E.R. Panier and A.L. Tits. Avoiding the Maratos effect by means of a nonmonotone line search I: General constrained problems. SIAM Journal on Numerical Analysis, 28:1183-1195, 1991.
284. E.R. Panier and A.L. Tits. On combining feasibility, descent and superlinear convergence in inequality constrained optimization. Mathematical Programming, 59(2):261-276, 1993.
285. E.R. Panier, A.L. Tits, and J. Herskovits. A QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization. SIAM Journal on Control and Optimization, 26:788-811, 1988.
286. T. Pietrzykowski. An exact potential method for constrained maxima. SIAM Journal on Numerical Analysis, 6:299-304, 1969.
287. E. Polak. Optimization-Algorithms and Consistent Approximations. Number 124 in Applied Mathematical Sciences. Springer, 1997.
288. B.T. Polyak. Introduction to Optimization. Optimization Software, New York, 1987.
289. F.A. Potra. An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence. Annals of Operations Research, 62:81-102, 1996.
290. M.J.D. Powell. A method for nonlinear constraints in minimization problems. In R. Fletcher, editor, Optimization, pages 283-298. Academic Press, London, New York, 1969.
291. M.J.D. Powell. On the convergence of the variable metric algorithm. Journal of the Institute of Mathematics and its Applications, 7:21-36, 1971.
292. M.J.D. Powell. Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In R.W. Cottle and C.E. Lemke, editors, Nonlinear Programming, number 9 in SIAM-AMS Proceedings. American Mathematical Society, Providence, RI, 1976.
293. M.J.D. Powell. Algorithms for nonlinear constraints that use Lagrangian functions. Mathematical Programming, 14:224-248, 1978.
294. M.J.D. Powell. The convergence of variable metric methods for nonlinearly constrained optimization calculations. In O.L. Mangasarian, R.R. Meyer, and S.M. Robinson, editors, Nonlinear Programming 3, pages 27-63, 1978.
295. M.J.D. Powell. A fast algorithm for nonlinearly constrained optimization calculations. In G.A. Watson, editor, Numerical Analysis Dundee 1977, number 630 in Lecture Notes in Mathematics, pages 144-157. Springer-Verlag, Berlin, 1978.
296. M.J.D. Powell. Nonconvex minimization calculations and the conjugate gradient method. In Lecture Notes in Mathematics 1066, pages 122-141. Springer-Verlag, Berlin, 1984.
297. M.J.D. Powell. Convergence properties of algorithms for nonlinear optimization. SIAM Review, 28:487-500, 1985.
298. M.J.D. Powell. On the quadratic programming algorithm of Goldfarb and Idnani. Mathematical Programming Study, 25:46-61, 1985.
299. M.J.D. Powell. The performance of two subroutines for constrained optimization on some dificult test problems. In P.T. Boggs, R.H. Byrd, and R.B. Schnabel, editors, Numerical Optimization 1984, pages 160-177. SIAM Publication, Philadelphia, 1985.
300. M.J.D. Powell. A view of nonlinear optimization. In J.K. Lenstra, A.H.G. Rinnooy Kan, and A. Schrijver, editors, History of Mathematical Programming, A Collection of Personal Reminiscences, pages 119-125. CWI North-Holland, Amsterdam, 1991.
301. M.J.D. Powell and Y. Yuan. A recursive quadratic programming algorithm that uses differentiable exact penalty functions. Mathematical Programming, 35:265-278, 1986.
302. B.N. Pshenichnyj. Algorithm for a general mathematical programming problem. Kibernetika, 5:120-125, 1970.
303. B.N. Pshenichnyj. The Linearization Method for Constrained Optimization. Number 22 in Computational Mathematics. Springer-Verlag, 1994.
304. B.N. Pshenichnyj and Yu.M. Danilin. Numerical Methods for Extremal Problems. MIR, Moscow, 1978.
305. W. Queck. The convergence factor of preconditioned algorithms of the Arrow-Hurwicz type. SIAM Journal on Numerical Analysis, 26:1016-1030, 1989.
306. J.K. Reid. A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases. Mathematical Programming, 24:55-69, 1982.
307. P.A. Rey and C.A. Sagastizábal. Dynamical adjustment of the prox-parameter in variable metric bundle methods. Optimization, 51(2):423-447, 2002.
308. S.M. Robinson. A quadratically convergent algorithm for general nonlinear programming problems. Mathematical Programming, 3:145-156, 1972.
309. S.M. Robinson. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms. Mathematical Programming, 7:1-16, 1974.
310. S.M. Robinson. Generalized equations and their solutions, part II: applications to nonlinear programming. Mathematical Programming Study, 19:200-221, 1982.
311. R.T. Rockafellar. Convex Analysis. Number 28 in Princeton Mathematics Ser. Princeton University Press, Princeton, New Jersey, 1970.
312. R.T. Rockafellar. New applications of duality in convex programming. In Proceedings of the 4th Conference of Probability, Brasov, Romania, pages 73-81, 1971.
313. R.T. Rockafellar. Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM Journal on Control, 12:268-285, 1974.
314. R.T. Rockafellar. Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Mathematics of Operations Research, 1:97-116, 1976.
315. R.T. Rockafellar. Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization, 14:877-898, 1976.
316. R.T. Rockafellar and R.J.-B. Wets. Variational Analysis. Springer Verlag, Heidelberg, 1998.
317. T. Rusten and R. Winthier. A preconditioned iterative method for saddle point problems. SIAM Journal on Matrix Analysis and Applications, 13:887-904, 1992.
318. A. Ruszczyński. Decomposition methods in stochastic programming. In Mathematical Programming, volume 79, 1997.
319. C. Sagastizábal and M.V. Solodov. On the relation between bundle methods for maximal monotone inclusions and hybrid proximal point algorithms.
320. In Inherently parallel algorithms in feasibility and optimization and their applications (Haifa, 2000), volume 8 of Stud. Comput. Math., pages 441-455. North-Holland, Amsterdam, 2001.
321. C. Sagastizábal and M.V. Solodov. An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM Journal on Optimization, 16(1):146-169, 2005.
322. R. Saigal. Linear Programming: A Modern Integrated Analysis. Kluwer Academic Publishers, Boston, 1995.
323. R.W.H. Sargent. The development of SQP algorithm for nonlinear programming. In L.T. Biegler, T.F. Coleman, A.R. Conn, and F.N. Santosa, editors, Large-Scale Optimization with Applications, part II: Optimal design and Control, pages 1-19. IMA Vol. Math. Appl. 93, 1997.
324. R.W.H. Sargent and M. Ding. A new SQP algorithm for large-scale nonlinear programming. SIAM Journal on Optimization, 11:716-747, 2000.
325. K. Schittkowski. The nonlinear programming method of Wilson, Han and Powell with an augmented Lagrangian type line search function, Part 1: convergence analysis. Numerische Mathematik, 38:83-114, 1981.
326. K. Schittkowski. NLPQL: a FORTRAN subroutine solving constrained nonlinear programming problems. Annals of Operations Research, 5:485-500, 1985.
327. K. Schittkowski. Solving nonlinear programming problems with very many constraints. Optimization, 25:179-196, 1992.
328. K. Schittkowski. Numerical Data Fitting in Dynamical Systems. Kluwer Academic Press, Dordrecht, 2002.
329. H. Schramm and J. Zowe. A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM Journal on Optimization, 2(1):121-152, 1992.
330. Scilab. A free scientific software package. http://www.scilab.org/.
331. D.F. Shanno. Conjugate gradient methods with inexact searches. Mathematics of Operations Research, 3:244-256, 1978.
332. D.F. Shanno and K.H. Phua. Algorithm 500, minimization of unconstrained multivariate functions. ACM Transactions on Mathematical Software, 2:87-94, 1976.
333. A. Shapiro and J. Sun. Some properties of the augmented Lagrangian in cone constrained optimization. Mathematics of Operations Research, 29:479-491, 2004.
334. N. Shor. Utilization of the operation of space dilatation in the minimization of convex functions. Kibernetica, 1:6-12, 1970
335. (English translation: Cybernetics, 6, 7-15).
336. N.Z. Shor. Minimization methods for non-differentiable functions. Springer Verlag, Berlin, 1985.
337. D. Silvester and A.Wathen. Fast iterative solution of stabilized Stokes systems part II: using general block preconditioners. SIAM Journal on Numerical Analysis, 31:1352-1367, 1994.
338. M. Slater. Lagrange multipliers revisited: a contribution to non-linear programming. Cowles Commission Discussion Paper, Math. 403, 1950.
339. M. V. Solodov. A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework. Optim. Methods Softw., 19(5):557-575, 2004.
340. M. V. Solodov and B. F. Svaiter. A hybrid approximate extragradientproximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal., 7(4):323-345, 1999.
341. M. V. Solodov and B. F. Svaiter. A hybrid projection-proximal point algorithm. J. Convex Anal., 6(1):59-70, 1999.
342. M. V. Solodov and B. F. Svaiter. A uniéd framework for some inexact proximal point algorithms. Numerical Functional Analysis and Optimization, 22:1013-1035, 2001.
343. B. Speelpenning. Compiling fast partial derivatives of functions given by algorithms. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, 1980.
344. P. Spellucci. Numerische Verfahren der nichtlinearen Optimierung. Birkhäuser, 1993.
345. P. Spellucci. A new technique for inconsistent problems in the SQP method. Mathematical Methods of Operations Research, 47:355-400, 1998.
346. P. Spellucci. An SQP method for general nonlinear programs using only equality constrained subproblems. Mathematical Programming, 82:413-448, 1998.
347. J. E. Spingarn. Partial inverse of a monotone operator. Appl. Math. Optim., 10(3):247-265, 1983.
348. M. Spivak. A Comprehensive Introduction to Differential Geometry. Publish or Perish, 1979.
349. T. Steihaug. The conjugate gradient method and trust regions in large scale optimization. SIAM Journal on Numerical Analysis, 20:626-637, 1983.
350. R.A. Tapia. Diagonalized multiplier methods and quasi-Newton methods for constrained optimization. Journal of Optimization Theory and Applications, 22:135-194, 1977.
351. R.A. Tapia. On secant updates for use in general constrained optimization. Mathematics of Computation, 51:181-202, 1988.
352. T. Terlaky, editor. Interior Point Methods of Mathematical Programming. Kluwer Academic Publishers, Boston, 1996.
353. T. Terlaky, J. P. Vial, and K. Roos. Theory and algorithms for linear optimization: an interior point approach. Wiley intersciences, New York, 1997.
354. M.J. Todd. On convergence properties of algorithms for unconstrained minimization. IMA Journal of Numerical Analysis, 9(3):435-441, 1989.
355. K. Tone. Revisions of constraint approximations in the successive QP method for nonlinear programming problems. Mathematical Programming, 26:144-152, 1983.
356. P. Tseng. Alternating projection-proximal methods for convex programming and variational inequalities. SIAM J. Optim., 7(4):951-965, 1997.
357. R.J. Vanderbei. Linear Programming: Foundations and extensions. Kluwer Academic Publishers, Boston, 1997.
358. S.A. Vavasis. Nonlinear Optimization-Complexity Issues. Oxford University Press, New York, 1991.
359. R. Verfürth. A combined conjugate gradient-multigrid algorithm for the numerical solution of the Stokes problem. IMA Journal of Numerical Analysis, 4:441-455, 1984.
360. K. Veselič. Finite catenary and the method of Lagrange. SIAM Review, 37:224-229, 1995.
361. M. Wagner and M.J. Todd. Least-change quasi-Newton updates for equalityconstrained optimization. Mathematical Programming, 87:317-350, 2000.
362. A.Wathen and D. Silvester. Fast iterative solution of stabilized Stokes systems part I: using simple diagonal preconditioners. SIAM Journal on Numerical Analysis, 30:630-649, 1993.
363. R.B. Wilson. A simplicial algorithm for concave programming. PhD thesis, Graduate School of Business Administration, Harvard University, Cambridge, MA, USA, 1963.
364. P. Wolfe. A duality theorem for nonlinear programming. Quarterly Applied Mathematics, 19:239-244, 1961.
365. P. Wolfe. Convergence conditions for ascent methods. SIAM Review, 11:226-235, 1969.
366. P.Wolfe. A method of conjugate subgradients for minimizing nondifferentiable functions. Mathematical Programming Study, 3:145-173, 1975.
367. H. Wolkowicz, R. Saigal, and L. Vandenberghe, editors. Handbook of Semidefinite Programming-Theory, Algorithms, and Applications. Kluwer Academic Publishers, 2000.
368. S.J. Wright. A path-following infeasible-interior-point algorithm for linear complementarity problems. Optimization Methods and Software, 2:79-106, 1993.
369. S.J. Wright. An infeasible interior point algorithm for linear complementarity problems. Mathematical Programming, 67:29-52, 1994.
370. S.J. Wright. Primal-dual interior-point methods. SIAM, Philadelphia, 1996.
371. S.J. Wright. Superlinear convergence of a stabilized SQP method to a degenerate solution. Computational Optimization and Applications, 11:253-275, 1998.
372. Y. Xie and R.H. Byrd. Practical update criteria for reduced Hessian SQP: global analysis. SIAM Journal on Optimization, 9:578-604, 1999.
373. X. Xu, P.F. Hung, and Y. Ye. A simplification of the homogeneous and self-dual linear programming algorithm and its implementation. Annals of Operations Research, 62:151-172, 1996.
374. Y. Ye. Interior point algorithms. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York, 1997.
375. Y. Ye. On homogeneous and self-dual algorithm for LCP. Mathematical Programming, 76:211-222, 1997.
376. Y. Ye, M.J. Todd, and S. Mizuno. An O(pnL)-iteration homogeneous and self-dual linear programming algorithm. Mathematics of Operations Research, 19:53-67, 1994.
377. Y. Yuan. An only 2-step Q-superlinearly convergence example for some algorithms that use reduced Hessian informations. Mathematical Programming, 32:224-231, 1985.
378. W.I. Zangwill. Non-linear programming via penalty functions. Management Science, 13:344-358, 1967.
379. Y. Zhang. On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optimization, 4:208-227, 1994.
380. G. Zoutendijk. Nonlinear programming, computational methods. In J. Abadie, editor, Integer and Nonlinear Programming, pages 37-86. North-Holland, Amsterdam, 1970.