A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems

Optimization

Volumn 60, Issue 8-9, 2011, Pages 1091-1104

  Dutta, Joydeep ^a   Kaya, C Yalç ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

efficient set; multi objective optimization; nonconvex optimization; nonsmooth optimization; numerical methods; Pareto front; Tchebychev scalarization

Indexed keywords

EID: 84858203481     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331934.2011.587006     Document Type: Article

References (28)

1. Audet, C, Savard, G and Zghal, W. 2008. Multiobjective optimization through a series of single-objective formulations. SIAM J. Optim., 19: 188-210.
2. Bonnel, H and Kaya, CY. 2010. Optimization over the efficient set of multi-objective convex optimal control problems. J. Optim. Theory Appl., 147: 93-112.
3. Burachik, RS, Gasimov, RN, Ismayilova, NA and Kaya, CY. 2006. On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian. J. Global Optim., 34: 55-78.
4. Burachik, RS and Kaya, CY. 2007. An update rule and a convergence result for a penalty function method. J. Indust. Man. Optim., 3: 381-398.
5. Burachik, RS and Kaya, CY. 2010. "A deflected subgradient algorithm using a general augmented Lagrangian duality with implications on penalty methods". In Variational Analysis and Optimization, Edited by: Burachik, RS and Yao, JC. 109-132. Berlin, Heidelberg: Springer Verlag.
6. Burachik, RS, Kaya, CY and Mammadov, M. 2010. An inexact modified subgradient algorithm for nonconvex optimization. Comput. Optim. Appl., 45: 1-24.
7. Das, I and Dennis, JE. 1998. Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim., 8: 631-657.
8. Deb, K, Pratap, A, Agarwal, S and Meyarivan, T. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Computat., 6: 182-197.
9. Eichfelder, G. 2008. Adaptive Scalarization Methods in Multiobjective Optimization, Berlin, Heidelberg: Springer.
10. Eichfelder, G. 2009. An Adaptive scalarization method in multi-objective optimization. SIAM J. Opt., 19: 1694-1718.
11. Eichfelder, G. 2009. Scalarizations for adaptively solving multi-objective optimization problems. Comput. Optim. Appl., 44: 249-273.
12. Engau, A and Wiecek, MM. 2007. Generating ε{lunate}-efficient solutions in multiobjective programming. Euro. J. Oper. Res., 177: 1566-1579.
13. Fernández, J and Boglárka, T. 2009. Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods. Comput. Optim. Appl., 42: 393-419.
14. Fliege, J, Graña Drummond, LM and Svaiter, BF. 2009. Newton's method for multiobjective optimization. SIAM J. Optim., 20: 602-626.
15. Gourion, D and Luc, DT. 2008. Generating the weakly efficient set of nonconvex multiobjective problems. J. Global Optim., 41: 517-538.
16. Kao, GK and Jacobson, SH. 2008. Finding preferred subsets of Pareto optimal solutions. Comput. Optim. Appl., 40: 73-95.
17. Kuntsevich, A and Kappel, F. 1997. SolvOpt: The Solver for Local Nonlinear Optimization Problems, Austria: Karl-Franzens University of Graz.
18. Kursawe, F. 1991. "A variant of evolution strategies for vector optimization". In Parallel Problem Solving from Nature - PPSN I, Lect. Notes Comp. Sci. 496, Edited by: Schwefel, H-R and Manner, R. 193-197. Berlin, Heidelberg: Springer.
19. Lagarias, JC, Reeds, JA, Wright, MH and Wright, PE. 1998. Convergence properties of the Nelder-Mead simplex method in low dimensions. SIAM J. Optim., 9: 112-147.
20. Luc, DT, Phong, TQ and Volle, M. 2005. Scalarizing functions for generating the weakly efficient solution set in convex multiobjective problems. SIAM J. Optim., 15: 987-1001.
21. Miettinen, KM. 1999. Nonlinear Multiobjective Optimization, Boston: Kluwer.
22. Miglierina, E, Melho, E and Recchioni, MC. 2008. Box-constrained multi-objective optimization: A gradient-like method without 'a priori' scalarization. Euro. J. Oper. Res., 188: 662-682.
23. Mueller-Gritschneder, D, Graeb, H and Schlichtmann, U. 2009. A successive approach to compute the bounded Pareto front of practical multiobjective optimization problems. SIAM J. Optim., 20: 915-934.
24. Ogryczak, W. 2001. Comments on properties of the minmax solutions in goal programming. Euro. J. Oper. Res., 132: 17-21.
25. Preuss, M, Naujoks, B and Rudolph, G. 2006. "Pareto set and EMOA behaviour for simple multimodal multiobjective functions". In Parallel Problem Solving from Nature - PPSN IX, Lect. Notes Comp. Sci. 4193, Edited by: Runarsson, TP, Beyer, H-G, Burke, E, Merelo-Guervos, JJ, Whitley, LD and Yao, X. 513-522. Berlin, Heidelberg: Springer.
26. Shor, NZ. 1985. Minimization Methods for Non-Differentiable Functions, Springer Series in Computational Mathematics, Vol. 3, Berlin: Springer-Verlag.
27. Tanaka, M, Watanabe, H, Furukawa, Y and Tanino, T. 1995. GA-based decision support system for multicriteria optimization, Vol. 2, 1556-1561. Man and Cybernetics: Proceedings of the IEEE International Conference on Systems.
28. Utyuzhnikov, SV, Fantini, P and Guenov, MD. 2009. A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization. J. Comput. Appl. Math., 223: 820-841.