Convergence of the BFGS method for LC1 convex constrained optimization

SIAM Journal on Control and Optimization

Volumn 34, Issue 6, 1996, Pages 2051-2063

  Chen, Xiaojun ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Convex programming; Nonsmooth equations; Quasi Newton methods

Indexed keywords

NONSMOOTH EQUATIONS; QUASI-NEWTON METHODS;

COMPUTER PROGRAMMING; FUNCTIONS; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS;

OPTIMIZATION;

EID: 0030284902     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012994274823     Document Type: Article

References (37)

1. D. P. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
2. J. BONNANS, J. GILBERT, C. LEMARÉCHAL, AND C. SAGASTIZÁBAL, A family of variable metric proximal methods, Math. Programming, 68 (1995), pp. 15-47.
3. C. G. BROYDEN, J. E. DENNIS, AND J. J. MORÉ, On the local and superlinear convergence of quasi-Newton methods, J. Inst. Math. Appl., 12 (1973), pp. 223-246.
4. R. H. BYRD AND J. NOCEDAL, A tool for the analysis of quasi-Newton methods with application to unconstrained minimization, SIAM J. Numer. Anal., 26 (1989), pp. 727-739.
5. X. CHEN, On the convergence of Broyden-like methods for nonlinear equations with nondifferentiable terms, Ann. Inst. Statist. Math., 42 (1990), pp. 387-401.
6. X. CHEN AND L. QI, A parameterized Newton method and a quasi-Newton method for nonsmooth equations, J. Comp. Optim. Appl., 3 (1994), pp. 157-179.
7. X. CHEN, L. QI, AND R. S. WOMERSLEY, Newton's method for quadratic stochastic programs with recourse, J. Comput. Appl. Math., 60 ( 1995), pp. 29-46.
8. X. CHEN AND R. S. WOMERSLEY, A parallel inexact Newton method for stochastic programs with recourse, Ann. Oper. Res., (1996), to appear.
9. X. CHEN AND T. YAMAMOTO, On the convergence of some quasi-Newton methods for nonlinear equations with nondifferentiable operators, Computing, 48 (1992), pp. 87-94.
10. J. E. DENNIS AND J. J. MORÉ, A characterization of superlinear convergence and its application to quasi-Newton methods, Math. Comp., 28 (1974), pp. 549-560.
11. J. E. DENNIS, JR., AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1983.
12. J. E. DENNIS AND H. F. WALKER, Convergence theorems for least-change secant update methods, SIAM J. Numer. Anal., 18 (1981), pp. 949-987.
13. 1 functions and the Maratos effect, Oper. Res. Lett., 17 (1995), pp. 131-137.
14. R. FLETCHER, Practical Methods of Optimization, 2nd ed., John Wiley & Sons Ltd., Chichester, New York, 1987.
15. J. C. GILBERT AND C. LEMARÉCHAL, Some numerical experiments with variable-storage quasi-Newton algorithms, Math. Programming, 45 (1989), pp. 407-435.
16. M. A. GOMES-RUGGIERO, J. M. MARTÍNEZ, AND S. A. SANTOS, Solving nonsmooth equations by means of quasi-Newton methods with globalization, in Recent Advances in Nonsmooth Optimization, D. Du, L. Qi, and R. S. Womersley, eds., World Scientific, River Edge, NJ, 1995, pp. 121-140.
17. M. HEINKENSCHLOSS, C. T. KELLEY, AND H. T. TRAN, Fast algorithms for nonsmooth compact fixed point problems, SIAM J. Numer. Anal., 29 (1992), pp. 1769-1792.
18. J. B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms, Springer-Verlag, New York, 1993.
19. C. M. IP AND J. KYPARISIS, Local convergence of quasi-Newton methods for B-differentiable equations, Math. Programming, 56 (1992), pp. 71-89.
20. H. JIANG AND L. QI, Local uniqueness and convergence of iterative methods for nonsmooth variational inequalities, J. Math. Anal. Appl., 196 (1995), pp. 314-331.
21. 1 equations, J. Oper. Res. Soc. Japan, 29 (1986), pp. 352-374.
22. J. M. MARTÍNEZ, On the relation between two local convergence theories of least change secant update methods, Math. Comp., 59 (1992), pp. 457-481.
23. J. M. MARTÍNEZ AND M. C. ZAMBALDI, Least change update methods for nonlinear systems with nondifferentiable terms, Numer. Funct. Anal. Optim., 14 (1993), pp. 405-415.
24. J. M. ORTEGA AND W. C. RHEINBOLDT, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
25. J. S. PANG, Newton methods for B-differentiable equations, Math. Oper. Res., 15 (1990), pp. 311-341.
26. J. S. PANG, S. P. HAN, AND N. RANGARAJ, Minimization of locally Lipschitzian functions, SIAM J. Optim., 1 (1991), pp. 57-82.
27. J. S. PANG AND L. QI, Nonsmooth equations: motivation and algorithms, SIAM J. Optim., 3 (1993), pp. 443-465.
28. 1 minimization problems, J. Optim. Theory Appl., 85 (1995), pp. 633-648.
29. M. J. D. POWELL, Some global convergence properties of a variable metric algorithm for minimization without exact line searches, in Nonlinear Programming, SIAM-AMS Proceedings, Vol. IX, R. W. Cottle and C. E. Lemke, eds., American Mathematical Society, Providence, RI, 1976.
30. L. QI, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res., 18 (1993), pp. 227-244.
31. 1 optimization problems, Math. Programming, 64 (1994), pp. 277-294.
32. L. QI AND J. SUN, A nonsmooth version of Newton's method, Math. Programming, 58 (1993), pp. 353-367.
33. L. QI AND R. WOMERSLEY, An SQP algorithm for extended linear-quadratic problems in stochastic programming, Ann. Oper. Res., 56 (1995), pp. 251-285.
34. R. T. ROCKAFELLAR AND R. J.-B. WETS, A dual solution procedure for quadratic stochastic programs with simple recourse, in Numerical Methods, Lecture Notes in Mathematics 1005, V. Pereyra and A. Reinoza, eds., Springer-Verlag, Berlin, 1983, pp. 252-265.
35. _, Linear-quadratic problems with stochastic penalties: The finite generation algorithm, in Stochastic Optimization, Lecture Notes in Control and Information Sciences 81, V. I. Arkin, A. Shiraev, and R. J.-B. Wets, eds., Springer-Verlag, Berlin, 1987, pp. 545-560.
36. _, Generalized linear-quadratic problems of deterministic and stochastic optimal control in discrete time, SIAM J. Control Optim., 28 (1990), pp. 810-822.
37. C. ZHU AND R. T. ROCKAFELLAR, Primal-dual projected gradient algorithms for extended linear-quadratic programming, SIAM J. Optim., 3 (1993), pp. 751-783.