A projected gradient method for vector optimization problems

Computational Optimization and Applications

Volumn 28, Issue 1, 2004, Pages 5-29

  Grana Drummond L M ^a   Iusem, A N ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b IMPA   (Brazil)

Author keywords

Convexity with respect to cones; Pareto optimality; Projected gradient methods; Quasi Fej r convergence; Weak efficiency

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; GEOMETRY; GRADIENT METHODS; PARETO PRINCIPLE; PROBLEM SOLVING; SET THEORY; VECTORS;

CONVEX CONE; CONVEXITY; PARETO OPTIMALITY; PROJECTED GRADIENT METHOD; QUASI-FEJER CONVERGENCE; VECTOR OPTIMIZATION PROBLEMS; WEAK EFFICIENCY;

OPTIMIZATION;

EID: 1942486330     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:COAP.0000018877.86161.8b     Document Type: Article

References (26)

1. C.D. Aliprantis, M. Florenzano, V.F. Martins da Rocha, and R. Tourky, "General equilibrium in infinite security markets," Preprint, Université de Paris 1, 2002.
2. C.D. Aliprantis, M. Florenzano, and R. Tourky, "General equilibrium analysis in ordered topological vector spaces," Preprint, Université de Paris 1, 2002.
3. Ya.I. Alber, A.N. Iusem, and M.V. Solodov, "On the projected subgradient method for nonsmooth convex optimization in a Hilbert space," Mathematical Programming, vol. 81, pp. 23-37, 1998.
4. V.A. Bereznyev, V.G. Karmanov, and A.A. Tretyakov, "The stabilizing properties of the gradient method," USSR Computational Mathematics and Mathematical Physics, vol. 26, pp. 84-85, 1986.
5. D. Bertsekas, Nonlinear Programming, Athena Scientific: Belmont, 1995.
6. R. Burachik, L.M. Graña Drummond, A.N. Iusem, and B.F. Svaiter, "Full covergence of the steepest descent method with inexact line searches," Optimization, vol. 32, pp. 137-146, 1995.
7. R. Correa and C. Lemaréchal, "Convergence of some algorithms for convex optimization," Mathematical Programming, vol. 62, pp. 261-275, 1993.
8. N.O. Da Cunha and E. Polak, "Constrained minimization under vector-valued criteria in finite dimensional spaces," Journal of Mathematical Analysis and Applications, vol. 19, pp. 103-124, 1967.
9. J. Fliege and B.F. Svaiter, "Steepest descent methods for multicriteria optimimization," Mathematical Methods of Operations Research, vol. 51, pp. 479-494, 2000.
10. E.N. Gafni and D. Bertsekas, "Convergence of a gradient projection method," Technical Report LIDS-P-1201, Laboratory for Information and Decision Systems, M.I.T., 1982.
11. T. Gal and T. Hanne, "On the development and future aspects of vector optimization and MCDM," in Multicriteria Analysis. J. Clímaco (Ed.), Springer: Berlin, 1997, pp. 130-145.
12. A.M. Geoffrion, "Proper efficiency and the theory of vector maximization," Journal of Mathematical Analysis and Applications, vol. 22, pp. 618-630, 1968.
13. E. Golstein and N. Tretyakov, Modified Lagrange Functions, Moscow, 1989.
14. L.M. Graña Drummond and B.F. Svaiter, "A steepest descent method for vector optimization," Technical Report A2001/21, IMPA, Rio De Janeiro, 2001.
15. J.-B. Hiriart Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Springer: Berlin, 1993.
16. J.P. Ignizio, Goal Programming and Extensions. D.C. Heath and Co., 1976.
17. A.N. Iusem and B.F. Svaiter, "A proximal regularization of the steepest descent method," RAIRO, Recherche Opérationelle, vol. 29, no. 2, pp. 123-130, 1995.
18. J. Jahn, Mathematical Vector Optimization in Partially Ordered Linear Spaces, Verlag Peter D. Lang: Frankfurt, 1986.
19. J. Jahn, "Optimality conditions for set-valued optimization problems. Set valued optimization," Mathematical Methods of Operations Research, vol. 48, pp. 187-200, 1998.
20. K. Kiwiel and K. G. Murty, "Convergence of the steepest descent method for minimizing quasi convex functions," Journal of Optimization Theory and Applications, vol. 89, pp. 221-226, 1996.
21. D.T. Luc, Theory of Vector Optimization, Lecture Notes in Economy and Mathematic Systems 319. Springer: Berlin, 1989.
22. Y.E. Nesterov, Effective Methods in Nonlinear Programming, Moscow, 1989.
23. B.T. Polyak, Introduction to Optimization, Optimization Software: New York, 1987.
24. R.T. Rockafellar, Convex Analysis, Princeton University Press: New Jersey, 1970.
25. D.J. White, "A bibliography on the applications of mathematical programming objective methods," Journal of the Operational Research Society, vol. 41, pp. 669-691, 1990.
26. W.I. Zangwill, Nonlinear Programming: A Unified Approach, Prentice-Hall: New Jersey, 1969.