Tuning strategy for the proximity parameter in convex minimization

Journal of Optimization Theory and Applications

Volumn 130, Issue 1, 2006, Pages 95-112

  Fuduli, A ^a   Gaudioso, M ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Bundle methods; Nondifferentiable optimization; Proximal trajectories; Stability centers

Indexed keywords

AUTOMATIC TUNING; BUNDLE METHODS; CENTER-BASED; CONVEX MINIMIZATION; CUTTING PLANES; NON-DIFFERENTIABLE OPTIMIZATION; OBJECTIVE FUNCTIONS; PROXIMAL TRAJECTORY; STABILITY CENTER; TUNING STRATEGY;

SOFTWARE ENGINEERING;

EID: 33845615405     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-006-9090-z     Document Type: Article

References (32)

1. SHOR, N., Minimization Methods for Nondifferentiable Functions, Springer Verlag, Berlin, Germany, 1985.
2. WOLFE, P., A Method of Conjugate Subgradients for Minimizing Nondifferentiable Functions, Nondifferentiable Optimization, Mathematical Programming Study, Edited by M. Balinski and P.Wolfe, North-Holland, Amsterdam, Holland, Vol. 3, pp. 145-173, 1975.
3. LEMARÉCHAL, C., An Extension of Davidon Methods to Nondifferentiable Problems, Nondifferentiable Optimization, Mathematical Programming Study, Edited by M. Balinski and P. Wolfe, North-Holland, Amsterdam, Holland, Vol. 3, pp. 95-109, 1975.
4. GAUDIOSO, M., and MONACO, M. F., A Bundle-Type Approach to the Unconstrained Minimization of Convex Nonsmooth Functions, Mathematical Programming, Vol. 23, pp. 216-223, 1982.
5. FUKUSHIMA, M., A Descent Algorithm for Nonsmooth Convex Optimization, Mathematical Programming, Vol. 30, pp. 163-175, 1984.
6. KIWIEL, K. C., Proximity Control in Bundle Methods for Convex Nondifferentiable Minimization, Mathematical Programming, Vol. 46, pp. 105-122, 1990.
7. GAUDIOSO, M., and MONACO, M. F., Quadratic Approximations in Convex Nondifferentiable Optimization, SIAM Journal on Control and Optimization, Vol. 29, pp. 1-10, 1991.
8. KIWIEL, K. C., Efficiency of Proximal Bundle Methods, Journal of Optimization Theory and Applications, Vol. 104, pp. 589-603, 2000.
9. FRANGIONI, A., Generalized Bundle Methods, SIAM Journal on Optimization, Vol. 13, pp. 117-156, 2002.
10. MÄKELÄ, M., Survey of Bundle Methods for Nonsmooth Optimization, Optimization Methods and Software, Vol. 17, pp. 1-29, 2002.
11. ROCKAFELLAR, R., Monotone Operators and the Proximal Point Algorithm, SIAM Journal on Control and Optimization, Vol. 14, pp. 877-898, 1976.
12. LEMARÉCHAL, C., and SAGASTIZÁBAL, C. A., Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries, SIAM Journal on Optimization, Vol. 7, pp. 367-385, 1997.
13. QI, L., Second-Order Analysis of the Moreau-Yosida Regularization of a Convex Function, Technical Report AMR 94/20, University of New South Wales, 1994.
14. MIFFLIN, R., SUN, D., and QI, L., Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization, SIAM Journal on Optimization, Vol. 8, pp. 583-603, 1998.
15. RAUF, A., and FUKUSHIMA, M., Globally Convergent BFGS Method for Nonsmooth Convex Optimization, Journal of Optimization Theory and Applications, Vol. 104, pp. 539-558, 1998.
16. GAUDIOSO, M., Nonsmooth Optimization, Handbook of Applied Optimization, Edited by M. G. C. Resende and P. M. Pardalos, Oxford University Press, New York, NY, pp. 299-310, 2002.
17. HIRIART-URRUTY, J. B., and LEMARÉCHAL, C., Convex Analysis and Minimization Algorithms, Vols. I-II, Springer Verlag, New York, NY, 1993.
18. KIWIEL, K. C., Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics, Springer Verlag, Berlin, Germany, Vol. 1133, 1985.
19. MÄKELÄ, M., and NEITTAANMÄKI, P., Nonsmooth Optimization, World Scientific, Singapore, Republic of Singapore, 1992.
20. SCHRAMM, H., and ZOWE, J., A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, SIAM Journal on Optimization, Vol. 1, pp. 121-152, 1992.
21. FUDULI, A., GAUDIOSO, M., and GIALLOMBARDO, G., ADC Piecewise Affine Model and Bundling Technique in Nonconvex Nonsmooth Minimization, Optimization Methods and Software, Vol. 18, pp. 89-102, 2004.
22. FUDULI, A., GAUDIOSO, M., and GIALLOMBARDO, G., Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control, SIAM Journal on Optimization, Vol. 14, pp. 743-756, 2004.
23. ASTORINO, A., FUDULI, A., and GAUDIOSO, M., Analysis of Regularization Techniques in Convex Nondifferentiable Optimization, Operations Research Proceedings 1996, Berlin, Germany, pp. 20-25, 1996.
24. KIWIEL, K. C., Finding Normal Solutions in Piecewise Linear Programming, Applied Mathematics and Optimization, Vol. 32, pp. 235-254, 1995.
25. CHENEY, E. W., and GOLDSTEIN, A. A., Newton's Method for Convex Programming and Tchebycheff Approximation, Numerische Mathematik, Vol. 1, pp. 253-268, 1959.
26. KELLEY, J. E., The Cutting-Plane Method for Solving Convex Programs, SIAM Journal on Applied Mathematics, Vol. 8, pp. 703-712, 1960.
27. LEMARÉCHAL, C., NEMIROVSKIJ, A., and NESTEROV, Y., New Variants of Bundle Methods, Mathematical Programming, Vol. 69, pp. 111-147, 1995.
28. FUDULI, A., Metodi Numerici per la Minimizzazione di Funzioni Convesse Nondifferenziabili, PhD Thesis, Dipartimento di Elettronica Informatica e Sistemistica, Università della Calabria, 1998.
29. FRANGIONI, A., Solving Semidefinite Quadratic Problems within Nonsmooth Optimization Algorithms, Computers and Operations Research, Vol. 23, pp. 1099-1118, 1996.
30. DANIEL, J. W., GRAGG, W. B., KAUFMAN, L., and STEWART, G. W., Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization, Mathematics of Computation, Vol. 30, pp. 772-795, 1976.
31. LUKŠAN, L., and VLČEK, J., Test Problems for Nonsmooth Unconstrained and Linearly Constrained Optimization, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Technical Report No. 798, 2000.
32. GOLDFARB, D., and IDNANI, A., A Numerically Stable Dual Method for Solving Strictly Convex Quadratic Program, Mathematically Programming, Vol. 27, pp. 1-33, 1983.