An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter

SIAM Journal on Optimization

Volumn 16, Issue 1, 2006, Pages 146-169

  Sagastizabal, Claudia ^a,b   Solodov, Mikhail ^a  

^a IMPA   (Brazil)

^b INRIA ROCQUENCOURT   (France)

Author keywords

Bundle methods; Constrained optimization; Nonsmooth convex optimization

Indexed keywords

ALGORITHMS; ESTIMATION; OPTIMIZATION; PARAMETER ESTIMATION;

BUNDLE METHODS; CONSTRAINED OPTIMIZATION; NONSMOOTH CONVEX OPTIMIZATION;

CONVERGENCE OF NUMERICAL METHODS;

EID: 33144461315     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040603875     Document Type: Article

References (39)

1. A. AUSLENDER, Numerical methods for nondifferentiable convex optimization, Math. Programming Stud., 30 (1987), pp. 102-126.
2. J.F. BONNANS, J. CH. GILBERT, C. LEMARÉCHAL, AND C. SAGASTIZÁBAL, A family of variable metric proximal point methods, Math. Programming Ser. A, 68 (1995), pp. 15-47.
3. J.F. BONNANS, J. CH. GILBERT, C. LEMARÉCHAL, AND C. SAGASTIZÁBAL, Numerical Optimization. Theoretical and Practical Aspects, Universitext, Springer-Verlag, Berlin, 2003.
4. P.N. BROWN, Decay to uniform states in ecological interactions, SIAM J. Appl. Math., 38 (1980), pp. 22-37.
5. X. CHEN AND M. FUKUSHIMA, Proximal quasi-Newton methods for nondifferentiable convex optimization, Math. Program., 85 (1999), pp. 313-334.
6. E. CHENEY AND A. GOLDSTEIN, Newton's method for convex programming and Tchebycheff approximations, Numer. Math., 1 (1959), pp. 253-268.
7. R. CORREA AND C. LEMARÉCHAL, Convergence of some algorithms for convex minimization, Math. Program., 62 (1993), pp. 261-275.
8. R. FLETCHER AND S. LEYFFER, A Bundle Filter Method for Nonsmooth Nonlinear Optimization, Numerical Analysis Report NA/195, Department of Mathematics, The University of Dundee, Scotland, 1999.
9. R. FLETCHER AND S. LEYFFER, Nonlinear programming without a penalty function, Math. Program., 91 (2002), pp. 239-269.
10. A. FRANGIONI, Solving semidefinite quadratic optimization problems within nonsmooth optimization problems, Comput. Oper. Res., 23 (1996), pp. 1099-1118.
11. A. FRANGIONI, Generalized bundle methods, SIAM J. Optim., 13 (2002), pp. 117-156.
12. J.L. GOFFIN, A. HAURIE, AND J. PH. VIAL, Decomposition and nondifferentiable optimization with the projective algorithm, Management Sci., 38 (1992), pp. 284-302.
13. M. HINTERMÜLLER, A proximal bundle method based on approximate subgradients, Comput. Optim. Appl., 20 (2001), pp. 245-266.
14. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms, 2 Vols., Grund. der Math. Wiss. 305-306, Springer-Verlag, Berlin, 1993.
15. W. HOCK AND K. SCHITTKOWSKI, Test Examples for Nonlinear Programming Codes, Lecture Notes in Econ. Math. Syst. 187, Springer-Verlag, Berlin, 1981.
16. J.E. KELLEY, Jr., The cutting-plane method for solving convex programs, J. Soc. Indust. Appl. Math., 8 (1960), pp. 703-712.
17. K.C. KIWIEL, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Math. 1133, Springer-Verlag, Berlin, 1985.
18. K.C. KIWIEL, An exact penalty function algorithm for nonsmooth convex constrained minimization problems, IMA J. Numer. Anal., 5 (1985), pp. 111-119.
19. K.C. KIWIEL, A method for solving certain quadratic programming problems arising in non smooth optimization, IMA J. Numer. Anal., 6 (1986), pp. 137-152.
20. K.C. KIWIEL, A constraint linearization method for nondifferentiable convex minimization, Numer. Math., 51 (1987), pp. 395-414.
21. K.C. KIWIEL, A subgradient selection method for minimizing convex functions subject to linear constraints, Computing, 39 (1987), pp. 293-305.
22. K.C. KIWIEL, Proximity control in bundle methods for convex nondifferentiable minimization, Math. Program., 46 (1990), pp. 105-122.
23. K.C. KIWIEL, Exact penalty functions in proximal bundle methods for constrained convex non-differentiable minimization, Math. Program., 52 (1991), pp. 285-302.
24. C. LEMARÉCHAL AND R. MIFFLIN, A set of nonsmooth optimization test problems in Nonsmooth Optimization, C. Lemaréchal and R. Mifflin, eds., Pergamon Press, Oxford, 1978, pp. 151-165.
25. C. LEMARÉCHAL, A. NEMIROVSKII, AND YU. NESTEROV, New variants of bundle methods, Math. Program., 69 (1995), pp. 111-148.
26. C. LEMARÉCHAL AND C. SAGASTIZÁBAL, Variable metric bundle methods: From conceptual to implementable forms, Math. Program., 76 (1997), pp. 393-410.
27. L. LUKŠAN AND J. VLČEK, Globally convergent variable metric method for convex nonsmooth unconstrained optimization, J. Optim. Theory Appl., 102 (1999), pp. 593-613.
28. O.L. MANGASARIAN, Nonlinear Programming, McGraw-Hill, New York, 1969.
29. R. MIFFLIN, An algorithm for constrained optimization with semismooth functions, Math. Oper. Res., 2 (1977), pp. 191-207.
30. R. MIFFLIN, A modification and extension of Lemarechal's algorithm for nonsmooth minimization, Math. Programming Stud., 17 (1982), pp. 77-90.
31. R. MIFFLIN, A superlinearly convergent algorithm for one-dimensional constrained minimization problems with convex functions, Math. Oper. Res., 8 (1983), pp. 185-195.
32. R. MIFFLIN, A quasi-second-order proximal bundle algorithm, Math. Program., 73 (1996), pp. 51-72.
33. O. PIRONNEAU AND E. POLAK, Rate of convergence of a class of methods of feasible directions, SIAM J. Numer. Anal., 10 (1973), pp. 161-174.
34. B.T. POLYAK, Introduction to Optimization, Optimization Software, Inc., New York, 1987.
35. P. REY AND C. SAGASTIZÁBAL, Dynamical adjustment of the prox-parameter in bundle methods, Optimization, 51 (2002), pp. 423-447.
36. H. SCHRAMM AND J. ZOWE, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optim., 2 (1992), pp. 121-152.
37. N. SHOR, Minimization Methods for Non-differentiable Functions, Springer-Verlag, Berlin, 1985.
38. M.V. SOLODOV, On approximations with finite precision in bundle methods for nonsmooth optimization, J. Optim. Theory Appl., 119 (2003), pp. 151-165.
39. G. ZOUTENDIJK, Methods of Feasible Directions: A Study in Linear and Nonlinear Programming, Elsevier, Amsterdam, 1960.