A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization

Optimization Methods and Software

Volumn 19, Issue 1 SPEC. ISS., 2004, Pages 89-102

  Fuduli, A ^a   Gaudioso, M ^b   Giallombardo, G ^b,c  

^a UNIVERSITY OF SALENTO   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Bundle methods; Cutting planes; DC functions; Nonsmooth optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING; THEOREM PROVING;

BUNDLE METHODS; PIECEWISE AFFINE APPROXIMATION; PIECEWISE AFFINE CONVEX FUNCTIONS; PIECEWISE AFFINE MODEL;

MINIMIZATION OF SWITCHING NETS;

EID: 1542285805     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780410001648112     Document Type: Article

References (16)

1. K.C. Kiwiel (1996). Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM Journal on Optimization, 6, 227-249.
2. M. Mäkelä and P. Neittaanmäki (1992). Nonsmooth Optimization, World Scientific Publishing, Singapore.
3. H. Schramm and J. Zowe (1992). A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis. SIAM Journal on Optimization, 1, 121-152.
4. C. Lemaréchal (1976). Nondifferentiable optimization, subgradient and ε-subgradient methods. In: Optimization and Operations Research, Vol. 117 of Lecture Notes in Economics and Mathematical Systems, pp. 191-199, Springer-Verlag.
5. A. Fuduli, M. Gaudioso and G. Giallombardo (2003). Minimizing nonconvex nonsmooth functions via cutting planes and proximity controls. SIAM Journal on Optimization (to appear).
6. Demyanov, V.F. and Rubinov, A. (1995). Constructive Nonsmooth Analysis, Verlag Peter Lang, Frankfurt am Main.
7. F. Clarke (1983). Optimization and Nonsmooth Analysis, Wiley-Interscience, New York.
8. E.W. Cheney and A.A. Goldstein (1959). Newton's method for convex programming and Tchebycheff approximation. Numerische Mathematik, 1, 253-268.
9. J.E. Kelley (1960). The cutting-plane method for solving convex programs. Journal of SIAM, 8, 703-712.
10. R.T. Rockafellar (1976). Monotone operators and the proximal point algorithms. SIAM Journal on Control and Optimization, 14, 877-898.
11. J.B. Hiriart-Urruty and C. Lemaréchal (1993). Convex Analysis and Minimization Algorithms, Vol. I-II, Springer-Verlag, Berlin Heidelberg.
12. R. Mifflin (1977). An algorithm for constrained optimization with semismooth functions. Mathematics of Operations Research, 2, 191-207.
13. G. Outrata, M. Kocvara, and J. Zowe (1998). Nonsmooth approach to optimization problems with equilibrium constraints. Theory, Applications and Numerical Results, Kluwer Academic Publishers, Dordrecht.
14. K.C. Kiwiel (1983). An aggregate subgradient method for nonsmooth convex minimization. Mathematical Programming, 27, 320-341.
15. L. Lukš and J. Vlček (2000). Test problems for nonsmooth unconstrained and linearly constrained optimization. Tech. Report 798, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, pp. 1-34.
16. J. Vlček and L. Luksǎn (2001). Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization. Journal of Optimization Theory and Applications, 111, 407-430.