A proximal-type method for convex vector optimization problem in Banach spaces

Numerical Functional Analysis and Optimization

Volumn 30, Issue 1-2, 2009, Pages 70-81

  Chen, Zhe ^a,b   Zhao, Kequan ^a  

^a CHONGQING NORMAL UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Banach spaces; Lyapunov functional; Proximal type method; Vector optimization; Weak Pareto optimal solution; Weakly converge

Indexed keywords

BANACH SPACES; CONES; OPTIMAL SYSTEMS; PARETO PRINCIPLE; TELECOMMUNICATION NETWORKS; TOPOLOGY; VECTORS;

LYAPUNOV FUNCTIONAL; PROXIMAL-TYPE METHOD; VECTOR OPTIMIZATION; WEAK PARETO OPTIMAL SOLUTION; WEAKLY CONVERGE;

CONVEX OPTIMIZATION;

EID: 61449158027     PISSN: 01630563     EISSN: 15322467     Source Type: Journal    
DOI: 10.1080/01630560902735272     Document Type: Article

References (19)

1. Y. Alber and L Ryazantseva (2006). Nonlinear Ill-Posed Problems of Monotone Type. Springer-Verlag, Dordrecht.
2. A. Auslander and M. Haddou (1995). An interior proximal point method for convex linearly constrained problems and its extension to variational inequalities. Math. Program 71:77-100.
3. H.H. Bauschke and J.M. Borwein (1997). Lengendre function and the method of random Bregman functions. J. Convex Anal. 4:27-67.
4. H. Bonnel, A.N. Iusem, and B.F. Svaiter (2005). Proximal methods in vector optimization. SIAM J. Optim. 15(4):953-970.
5. R.S. Burachik and S. Scheimberg (2001). A proximal point algorithm for the variational inequality problem in Banach space. SIAM J. Control Optim. 39(5):1633-1649.
6. L.C. Ceng and J.C. Yao (2007). Approximate proximal methods in vector optimization. Eur. J. Oper. Res. 183(1):1-19.
7. G.Y. Chen. X.X. Huang, and X.Q. Yang (2005). Vector Optimization: Set-Valued and Variational Analysis. Lecture Notes in Economics and Mathematical Systems, 541. Springer-Verlag, Berlin.
8. T. Figiel (1976). On the moduli of convexity and smoothness. Studia Math. 56:121-151.
9. J. Fliege and B.F. Svaiter (2000). Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51:479-494.
10. L.M. Graña Drummond and A.N. Iusem (2004). A projected gradient method for vector optimization problems. Comput. Optim. Appl. 28:5-30.
11. O. Güler (1991). On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29:403-419.
12. X.X. Huang. K.L. Teo. and X.Q. Yang (2006). Calmness and exact penalization in vector optimization with cone constraints. Computat. Optim. Appl. 35:47-67.
13. J. Jahn (2004). Vector Optimization: Theory, Applications and Extensions. Springer-Verlag, Berlin.
14. S. Kamimura and W. Takahashi (2003). Strong convergence of a proximal-type algorithm in a Banach space. SIAM J. Optim. 13(3):938-945.
15. B. Matinet (1970). Regularisation d'inéquations variationelles par approximations successives. Rev. Francaise Inf. Rech. Oper. 2:154-159.
16. T. Pennanen (2002). Local convergence of the proximal point algorithm and multiplier methods without monotonicity. Math. Oper. Res. 27(1):170-191.
17. R.R. Phelps (1988). Convexfunctions, Montone Operators and Differentiability. Lecture Notes in Mathematics 1364. Springer. Berlin.
18. D. Pascali and S. Sburlan (1978). Nonlinear Mappings of Monotone Type. Sijthoff Noordhoff International Publishers. The Netherlands.
19. R.T. Rockafellar (1976). Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5):877-898.