×

A method for constrained multiobjective optimization based on SQP techniques. (English) Zbl 1349.90735

Summary: We propose a method for constrained and unconstrained nonlinear multiobjective optimization problems that is based on an SQP-type approach. The proposed algorithm maintains a list of nondominated points that is improved both for spread along the Pareto front and optimality by solving single-objective constrained optimization problems. These single-objective problems are derived as SQP problems based on the given nondominated points. Under appropriate differentiability assumptions we discuss convergence to local optimal Pareto points. We provide numerical results for a set of unconstrained and constrained multiobjective optimization problems in the form of performance and data profiles, where several performance metrics are used. The numerical results confirm the superiority of the proposed algorithm against a state-of-the-art multiobjective solver and a classical scalarization approach, both in the quality of the approximated Pareto front and in the computational effort necessary to compute the approximation.

MSC:

90C29 Multi-objective and goal programming
90C55 Methods of successive quadratic programming type
90C30 Nonlinear programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Advanced Concepts Team, {\it Multiple Gravity Assist with One Deep Space Manouvre (MGA-1DSM)}, , 2014.
[2] AMPL Optimization LLC, {\it AMPL: A Modeling Language for Mathematical Programming}, , 2012.
[3] J. F. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. A. Sagastizábal, {\it Numerical Optimization, Theoretical and Practical Aspects}, 2nd ed., Springer, Berlin, 2006. · Zbl 1108.65060
[4] L. Bradstree, {\it The Hypervolume Indicator for Multi-Objective Optimisation: Calculation and Use}, Ph.D. thesis, Department of Computer Science & Software Engineering, The University of Western Australia, Perth, Australia, 2011.
[5] Y. Collette and P. Siarry, {\it Multiobjective Optimization: Principles and Case Studies}, Springer, Berlin, Heidelberg, 2004. · Zbl 1103.90088
[6] A. L. Custódio, J. F. A. Madeira, A. I. F. Vaz, and L. N. Vicente, {\it Direct multisearch for multiobjective optimization}, SIAM J. Optim., 21 (2011), pp. 1109-1140, . · Zbl 1230.90167
[7] I. Das and J. E. Dennis, {\it Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems}, SIAM J. Optim., 8 (1998), pp. 631-657, . · Zbl 0911.90287
[8] K. Deb, {\it Multi-objective genetic algorithms: Problem difficulties and construction of test problems}, Evol. Comput., 7 (1999), pp. 205-230.
[9] E. D. Dolan and J. J. Moré, {\it Benchmarking optimization software with performance profiles}, Math. Program., 91 (2002), pp. 201-213. · Zbl 1049.90004
[10] G. Eichfelder, {\it Adaptive Scalarization Methods in Multiobjective Optimization}, Springer-Verlag, Berlin, Heidelberg, 2008. · Zbl 1145.90001
[11] G. Eichfelder, {\it An adaptive scalarization method in multiobjective optimization}, SIAM J. Optim., 19 (2009), pp. 1694-1718, . · Zbl 1187.90252
[12] E. Eskow and R. B. Schnabel, {\it Algorithm 695: Software for a new modified Cholesky factorization}, ACM Trans. Math. Software, 17 (1991), pp. 306-312. · Zbl 0900.65065
[13] J. Fliege, {\it Gap-free computation of Pareto-points by quadratic scalarizations}, Math. Methods Oper. Res., 59 (2004), pp. 69-89. · Zbl 1131.90054
[14] J. Fliege, L. M. G. Drummond, and B. F. Svaiter, {\it Newton’s method for multiobjective optimization}, SIAM J. Optim., 20 (2009), pp. 602-626, . · Zbl 1195.90078
[15] A. Göpfert and R. Nehse, {\it Vektoroptimierung}, Teubner Verlagsgesellschaft, Leipzig, 1990.
[16] J. Knowles, D. Corne, and K. Deb, eds., {\it Multiobjective Problem Solving from Nature: From Concepts to Applications}, Springer, Berlin, Heidelberg, 2008. · Zbl 1162.90003
[17] MATLAB, {\it version \(7.10.0\) (R \(2010\) a)}, The MathWorks Inc., Natick, MA, 2010. · Zbl 1200.93001
[18] D. Q. Mayne and E. Polak, {\it A superlinearly convergent algorithm for constrained optimization problems}, Math. Programming Stud., 16 (1982), pp. 45-61. · Zbl 0477.90071
[19] J. J. Moré and S. M. Wild, {\it Benchmarking derivative-free optimization algorithms}, SIAM J. Optim., 20 (2009), pp. 172-191, . · Zbl 1187.90319
[20] H. Nakayama, Y. Sawaragi, and T. Tanino, {\it Theory of Multiobjective Optimization}, Academic Press, Orlando, FL, 1985. · Zbl 0566.90053
[21] R. B. Schnabel and E. Eskow, {\it A revised modified Cholesky factorization algorithm}, SIAM J. Optim, 9 (1999), pp. 1135-1148, . · Zbl 0958.65034
[22] A. I. F. Vaz and L. N. Vicente, {\it A particle swarm pattern search method for bound constrained global optimization}, J. Global Optim., 39 (2007), pp. 197-219. · Zbl 1180.90252
[23] A. Wächter and L. T. Biegler, {\it On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming}, Math. Program., 106 (2005), pp. 25-57. · Zbl 1134.90542
[24] Q. Zhang, A. Zhou, S. Zhaoy, P. N. Suganthany, W. Liu, and S. Tiwariz, {\it Multiobjective Optimization Test Instances for the CEC \(2009\) Special Session and Competition}, Tech. Report CES-487, The School of Computer Science and Electronic Engineering, University of Essex, Colchester, UK, 2009.
[25] E. Zitzler, {\it Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications}, Vol. 63, Shaker, Ithaca, NY, 1999.
[26] E. Zitzler and L. Thiele, {\it Multiobjective optimization using evolutionary algorithms – a comparative case study}, in Parallel Problem Solving from Nature – PPSN V, Lecture Notes in Comput. Sci. 1498, A. E. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel, eds., Springer, Berlin, Heidelberg, 1998, pp. 292-301.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.