Convergence and efficiency of subgradient methods for quasiconvex minimization

Mathematical Programming, Series B

Volumn 90, Issue 1, 2001, Pages 1-25

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Complexity; Convex programming; Nondifferentiable optimization; Quasiconvex programming; Subgradient methods; Weak convergence

Indexed keywords

EID: 23744460434     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011414     Document Type: Article

References (39)

1. Alber, Ya.I., Iusem, A.N., Solodov, M.V. (1997): Minimization of nonsmooth convex functional in Banach spaces. J. Convex Anal. 4, 235-255
2. Alber, Ya.I., Iusem, A.N., Solodov, M.V. (1998): On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Math. Program. 81, 23-35
3. Boncompte, M., Martínez-Legaz, J.-E. (1991): Fractional programming by lower subdifferentiability techniques. J. Optim. Theory Appl. 68, 95-116
4. Cornejo, O., Jourani, A., Zlinescu, C. (1997): Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems. J. Optim. Theory Appl. 95, 127-148
5. n. In: Schaible, S., Ziemba, W.T., eds., Generalized Concavity in Optimization and Economics. Academic Press, New York, pp. 109-130
6. Demyanov, V.F., Vasilev, L.V. (1981): Nondifferentiable Optimization. Nauka, Moscow (Russian). English transl., Optimization Software Inc., New York, 1985
7. Dyer, M.E. (1980): Calculating surrogate constraints. Math. Program. 19, 255-278
8. Ekeland, I., Temam, R. (1976): Convex Analysis and Variational Problems. North-Holland, Amsterdam
9. Fenchel, W. (1952): A remark on convex sets and polarity. Communications du Séminaire Mathématique de l'Université de Lund, Supplement, pp. 82-89
10. Glover, F. (1975): Surrogate constraint duality in mathematical programming. Oper. Res. 23, 434-45)
11. Greenberg, H.J., Pierskalla, W.P. (1970): Surrogate mathematical programming. Oper. Res. 18, 924-939
12. Greenberg, H.J., Pierskalla, W.P. (1971): A review of quasi-convex functions. Oper. Res. 19, 1553-1570
13. Greenberg, H.J., Pierskalla, W.P. (1973): Quasiconjugate functions and surrogate duality. Cahiers Centre Études Rech. Oper. 15, 437-448
14. Ioffe, A.D., Tikhomirov, V.M. (1974): Theory of Extremal Problems. Nauka, Moscow (Russian). English transl., North-Holland, Amsterdam, 1979
15. Karwan, M.H., Rardin, R.L. (1984): Surrogate dual multiplier search procedures in integer programming. Oper. Res. 32, 52-69
16. Khabibullin, R.F. (1977): A generalized descent method for solving problems of minimization of functionals. (Russian) Issled. Prikl. Mat. 4, 23-30
17. Khabibullin, R.F. (1977): On a method for finding a point of a convex set. (Russian) Issled. Prikl. Mat. 4, 15-22
18. Nemirovskii, A.S. (1997): Method for solving a general quasiconvex programming problem. (Russian) Èkonom. Mat. Metody 33, 154-159
19. Nesterov, Yu.E. (1984): Minimization methods for nonsmooth convex and quasiconvex functions. (Russian) Èkonom. Mat. Metody 20, 519-531.
20. English transl. in Matekon 29(3), 519-531
21. Nesterov, Yu.E. (1989): Effective Methods in Nonlinear Programming. Radio i Sviaz, Moscow (Russian)
22. Passy, U., Prisman, E.Z. (1984): Conjugacy in quasiconvex programming. Math. Program. 30, 121-146
23. Penot, J.-P. (1996): Conditioning convex and nonconvex problems. J. Optim. Theory Appl. 90, 535-554
24. Penot, J.-P. (1998): Are generalized derivatives useful for generalized convex functions? In: Crouzeix, J.-P., Martínez-Legaz, J.-E., Volle, M., eds., Generalized Convexity, Generalized Monotonicity: Recent Results. Kluwer, Dordrecht, pp. 3-59
25. Penot, J.-P., Volle, M. (1990): On quasi-convex duality. Math. Oper. Res. 15, 597-625
26. Plastria, F. (1985): Lower subdifferentiable functions and their minimization by cutting planes. J. Optim. Theory Appl. 46, 37-53
27. Polyak, B.T. (1966): Existence theorems and convergence of minimizing sequences in extremum problems with restrictions. (Russian) Dokl. Akad. Nauk SSSR 166, 287-290.
28. English transl. in Soviet Math. Dokl. 7, 72-75
29. Polyak, B.T. (1967): A general method for solving extremum problems. (Russian) Dokl. Akad. Nauk SSSR 174, 33-36.
30. English transl. in Soviet Math. Dokl. 8, 593-597
31. Polyak, B.T. (1998): Private communication. October 1998
32. Rockafellar, R.T., Wets, R.J.-B. (1998): Variational Analysis. Springer, Berlin
33. Shor, N.Z. (1979): Minimization Methods for Non-Differentiable Functions. Naukova Dumka, Kiev (Russian). English transl., Springer, Berlin, 1985
34. Shunmugaraj, P. (1995): Well-set and well-posed minimization problems. Set-Valued Anal. 3, 281-294
35. Sikorski, J. (1986): Quasi-subgradient algorithms for calculating surrogate constraints. In: Malanowski, K., Mizukami, K., eds., Analysis and Algorithms of Optimization Problems. Springer, Berlin, pp. 203-236
36. Zabotin, Ya.I., Korablev, A.I., Khabibullin, R.F. (1972): On minimizing quasiconvex functionals. (Russian) Izv. Vyssh. Uchebn. Zaved. Mat. 10, 27-33
37. Zabotin, Ya.I., Korablev, A.I., Khabibullin, R.F. (1973): Conditions for an extremum of a functional in the presence of constraints. (Russian) Kibernetika 6, 65-70.
38. English transl. in Cybernetics 9 (1975), 982-988
39. Zolezzi, T. (1996): Extended well-posedness of optimization problems. J. Optim. Theory Appl. 91, 257-266