An efficient interior-point method for convex multicriteria optimization problems

Mathematics of Operations Research

Volumn 31, Issue 4, 2006, Pages 825-845

  Fliege, Jörg ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Convex multicriteria optimization; Interior point; Polynomial time

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

CONVEX MULTICRITERIA OPTIMIZATION; INTERIOR POINTS; POLYNOMIAL TIME;

OPTIMIZATION;

EID: 33847196771     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0221     Document Type: Article

References (40)

1. Benson, Harold P., Serpil Sayin. 1997. Towards finding global representations of the efficient set in multiple objective mathematical programming. Naval Res. Logist. 44 47-67.
2. Berkelaar, A. B. 1995. Complementarity and interior point methodology. Master's thesis, Department of Statistics, Probability and Operations Research, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands.
3. Berkelaar, Arjan B., Benjamin Jansen, Kees Roos, Tamás Terlaky. 1996. An interior-point approach to parametric convex quadratic programming. Working paper, Erasmus University Rotterdam, Rotterdam, The Netherlands. (February 29). Revised December 23, 1997.
4. Carrizosa, Emilio, Jörg Fliege. 2002. Generalized goal programming: Polynomial methods and applications. Math. Programming 93 281-303.
5. Das, Indraneel, J. E. Dennis. 1998. Normal-boundary intersection: A new method for generating Pareto optimal points in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3) 631-657.
6. Das, Indraneel, John Dennis. 1997. A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems. Structural Optim. 14(1) 63-69.
7. Fliege, Jörg. 2001. Approximation techniques for the set of efficient points. Professorial dissertation, Fachbereich Mathematik, Universität Dortmund, Dortmund, Germany. (January 31).
8. Fliege, Jörg. 2004. Gap-free computation of Pareto-points by quadratic scalarizations. Math. Methods Oper. Res. 59 69-89.
9. Fliege, Jörg, Andree Heseler. 2002. Constructing approximations to the efficient set of convex quadratic multiobjective problems. Ergebnisberichte Angewandte Mathematik 211, Fachbereich Mathematik, Universität Dortmund, 44221 Dortmund, Germany. (January). Forthcoming.
10. Geoffrion, Arthur M. 1968. Proper efficiency and the theory of vector maximization. J. Optim. Theory Appl. 22 618-630.
11. Gondzio, Jacek. 1998. Warm start of the primal-dual method applied in the cutting plane scheme. Math. Programming 83(1) 125-143.
12. Gondzio, Jacek, Andreas Grothey. 2003. Reoptimization with the primal-dual interior point method. SIAM J. Optim. 13 561-584.
13. Gondzio, Jacek, Jean-Pierre Vial. 1999. Warm start and ε-subgradients in a cutting plane scheme for block-angular linear programs. Comput. Optim. Appl. 14(1) 17-36.
14. Göpfert, Alfred, Reinhard Nehse. 1990. Vektoroptimierung - Theorie, Verfahren und Anwendungen. Mathematisch-Naturwissenschaftliche Bibliothek, Vol. 74. B. G. Teubner Verlagsgesellschaft, Leipzig, Germany.
15. Hadigheh, Alireza Ghaffari, Oleksandr Romanko, Tamás Terlaky. 2003. Sensitivity analyis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors. AdvOl-report 2003/6, Advanced Optimization Laboratory, McMaster University, Hamilton, Ontario, Canada. (December).
16. Haimes, Y. Y., Ralph E. Steuer, eds. 2000. Research and practice in multiple criteria decision making. Lecture Notes in Economics and Mathematical Systems, Vol. 487. Springer Verlag, Berlin, Germany.
17. Heermann, Christoph, Jörg Fliege, Bernd Weyers. 2004. A new adaptive algorithm for convex quadratic multicriteria optimization. Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Ralph E. Steuer, eds. Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Schloß Dagstuhl, Germany.
18. Heseler, Andree. 2000. Bestimmung effizienter Portefeuilles durch Warmstart-Innere-Punkt-Methoden. Diplomarbeit, Lehrstuhl für Wissenschaftliches Rechnen, Fachbereich Mathematik, Universität Dortmund, Dortmund, Germany.
19. Heseler, Andree. 2005. Warmstart-Strategien in der parametrisierten Optimierung mit Anwendung in der multikriteriellen Optimierung. Ph.D. thesis, Lehrstuhl für Wissenschaftliches Rechnen, Fachbereich Mathematik, Universität Dortmund, Dortmund, Germany.
20. Hillermeier, Claus. 2001. Nonlinear multiobjective optimization: A generalized homotopy approach. International Series of Numerical Mathematics, Vol. 25. Birkhäuser Verlag, Berlin, Germany.
21. Horst, R., P. Pardalos, eds. 1995. Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands.
22. Horst, R., H. Tuy. 1993. Global Optimization: Deterministic Approaches, 2nd ed. Springer, Berlin, Germany.
23. Jahn, Johannes. 1986. Mathematical Vector Optimization in Partially Ordered Linear Spaces. Verlag Peter Lang, Frankfurt, Germany.
24. Jahn, Johannes. 2004. Vector Optimization: Theory, Applications and Methods. Springer Verlag, Berlin, Germany.
25. Jüschke, A., J. Jahn, A. Kirsch. 1997. A bicriterial optimization problem of antenna design. Comput. Optim. Appl. 7 261-276.
26. Köksalan, M., S. Zionts, eds. 2001. Multiple criteria decision making in the new millennium. Proc. 15th Internat. Conf. Multiple Criteria Decision Making (MCDM), Ankara, Turkey, 2000. Springer Verlag, Berlin, Germany.
27. Markowitz, Harry M. 1987. Mean-Variance Analysis in Portfolio Choice and Capital Markets. Basil Blackwell Ltd., Oxford, UK.
28. Markowitz, Harry M. 1991. Portfolio Selection, Efficient Diversification of Investments, 2nd ed. Basil Blackwell Ltd., Oxford, UK.
29. Mitchell, John E. 2005. Cutting plane methods for conic programs. SIAM Conf. Optim. (May).
30. Nesterov, Yurii, Arkadii Nemirovskii. 1994. Interior-point polynomial algorithms in convex programming. SIAM Stud. Appl. Math., Vol. 13. Society for Industrial and Applied Mathematics, Philadelphia, PA.
31. Oskoorouchi, Mohammad E., John E. Mitchell. 2005. A second-order cone cutting surface method: Complexity and application. Available at http://www.optimization-online.org. (May 11).
32. Renegar, James. 1994. Linear Programming, Complexity Theory and Elementary Functional Analysis. Published as [32], (June).
33. Renegar, James. 1995. Linear programming, complexity theory and elementary functional analysis. Math. Programming 70A 279-351.
34. Renegar, James. 2001. A mathematical view of interior-point methods for convex optimizations. MPS-SIAM Ser. Optim., Philadelphia, PA.
35. Rudolf, Markus. 1994. Algorithms for Portfolio Optimization and Portfolio Insurance. Paul Haupt, Bern, Switzerland.
36. Sawaragi, Yoshikazu, Hirotaka Nakayama, Tetsuzo Tanino. 1985. Theory of multiobjective optimization. Mathematics in Science and Engineering, Vol. 176. Academic Press, Inc., Orlando, FL.
37. Steinbach, Mark C. 2001. Markowitz revisited: Mean-variance models in financial portfolio analysis. SIAM Rev. 43(1) 31-85.
38. Wohlmuth, Barbara I., Ronald H. W. Hoppe. 1999. A comparison of a posteriori error estimators for mixed finite element discretizations by Raviart-Thomas elements. Math. Comput. 68 1347-1378.
39. Yildirim, E. Alper, Michael J. Todd. 2001. Sensitivity analysis in linear programming and semidefinite programming using interior-point method. Math. Programming 90 229-261.
40. Yildirim, E. Alper, S. J. Wright. 2002. Warm-start strategies in interior-point methods for linear programming. SIAM J. Optim. 12 782-810.