Approximate proximal methods in vector optimization

European Journal of Operational Research

Volumn 183, Issue 1, 2007, Pages 1-19

  Ceng, Lu Chuan ^a   Yao, Jen Chih ^b  

^a SHANGHAI NORMAL UNIVERSITY   (China)

^b NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Banach space; Inexact algorithm; Proximal point; Vector optimization

Indexed keywords

BANACH SPACES; MAPPING; MATHEMATICAL OPERATORS; OPTIMIZATION; VECTORS;

INEXACT ALGORITHM; MONOTONE OPERATOR; PROXIMAL ALGORITHMS; VECTOR OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 34249099937     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.09.070     Document Type: Article

References (25)

1. Benker H., Hamel A., and Tammer C. An algorithm for vectorial control approximation problems. In: Fandel G., and Gal T. (Eds). Multiple Criteria Decision Making (1997), Springer, Berlin 3-12
2. Bolintineanu S. Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems. Journal of Optimization Theory and Applications 106 (2000) 265-296
3. Bolintineanu S. Vector variational principles; ε-efficiency and scalar stationarity. Journal of Convex Analysis 8 (2001) 71-85
4. Bonnel H., Iusem A.N., and Svaiter B.F. Proximal methods in vector optimization. SIAM Journal on Optimization 15 4 (2005) 953-970
5. Burachik R.S., Iusem A.N., and Svaiter B.F. Enlargement of monotone operators with applications to variational inequalities. Set-Valued Analysis 5 (1997) 159-180
6. Burachik R.S., Scheimberg S., and Svaiter B.F. Robustness of the hybrid extragradient proximal point algorithm. Journal of Optimization Theory and Applications 111 (2001) 117-136
7. Butnariu D., and Iusem A.N. Totally Convex Functions for Fixed Point Computation and Infinite Dimensional Optimization (2000), Kluwer, Dordrecht
8. Butnariu D., and Iusem A.N. On a proximal point method for convex optimization in Banach spaces. Numerical Functional Analysis and Optimization 18 7-8 (1997) 723-744
9. Chen G., and Teboulle M. A proximal-based decomposition method for convex minimization problems. Mathematical Programming 64 (1994) 81-100
10. P.J. da Silva e Silva, J. Eckstein, C. Humes, Rescaling and stepsize selection in proximal methods using separable generalized distance, Rutcor Research Report Rrr 35-99, Rutgers University, 1999.
11. Eckstein J. Approximate iterations in Bregman-function-based proximal algorithms. Mathematical Programming 83 (1998) 113-123
12. Fliege J., and Svaiter B.F. Steepest descent methods for multicriteria optimization. Mathematical Methods of Operations Research 51 (2000) 479-494
13. Gopfert A., Riahi H., Tammer C., and Zalinescu C. Variational Methods in Partially Ordered Spaces (2003), Springer, New York
14. Grana Drummond L.M., and Iusem A.N. A projected gradient method for vector optimization problems. Computational Optimization and Applications 28 (2004) 5-30
15. Grana Drummond L.M., and Svaiter B.F. A steepest descent method for vector optimization. Journal of Computational and Applied Mathematics 175 (2005) 395-414
16. He B.S. Inexact implicit methods for monotone general variational inequalities. Mathematical Programming 86 (1999) 199-217
17. Jahn J. Theory of vector maximization: Various concepts of efficient solutions. In: Gal T., Stewart T.J., and Hanne T. (Eds). Multicriteria Decision Making. Advances in MCDM Models, Algorithms, Theory, and Applications (1999), Kluwer, Boston 2-1-2-32
18. Kyono M., and Fukushima M. Nonlinear proximal decomposition method for convex programming. Journal of Optimization Theory and Applications 106 (2000) 357-372
19. Luc T.D. Theory of Vector Optimization. Lecture Notes in Economy and Mathematic Systems vol. 319 (1989), Springer, Berlin
20. Phelps R.R. Convex Functions, Monotone Operators and Differentiability. Lecture Notes in Mathematics vol. 1364 (1988), Springer, Berlin
21. Rockafellar R.T. Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization 14 (1976) 877-898
22. Solodov M.V., and Svaiter B.F. An inexact hybrid extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Analysis 7 (1999) 323-345
23. Solodov M.V., and Svaiter B.F. A hybrid projection-proximal point algorithm. Journal of Convex Analysis 6 (1999) 59-70
24. Solodov M.V., and Svaiter B.F. Forcing strong convergence of proximal point iterations in a Hilbert space. Mathematical Programming 87 (2000) 189-202
25. Solodov M.V., and Svaiter B.F. An inexact hybrid generalized proximal point algorithm and some new result on the theory of Bregman functions. Mathematics of Operations Research 25 (2000) 214-230