The Multi-Objective Polynomial Optimization

References

• [1] Anagnostopoulos A, Becchetti L, Castillo C, Gionis A, Leonardi S (2012) Online team formation in social networks. WWW’12 Proc. 21st Internat. Conf. World Wide Web (Association for Computing Machinery, New York), 839–848.Google Scholar
• [2] Bao T, Mordukhovich B (2007) Variational principles for set-valued mappings with applications to multiobjective optimization. Control Cybernetics 36(3):531–562.Google Scholar
• [3] Bao TQ, Mordukhovich BS (2010) Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions. Math. Program. 122(2):301–347.Crossref, Google Scholar
• [4] Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization, Athena Scientific Series in Optimization and Neural Computation, vol. 6 (Athena Scientific, Belmont, MA).Google Scholar
• [5] Blanco V, Puerto J, El Haj Ben Ali S (2014) A semidefinite programming approach for solving multiobjective linear programming. J. Global Optim. 58(3):465–480.Crossref, Google Scholar
• [6] Chen B, Lin Y, Zeng W, Xu H, Zhang D (2017) The mean-variance cardinality constrained portfolio optimization problem using a local search-based multi-objective evolutionary algorithm. Appl. Intelligence 47:505–525.Crossref, Google Scholar
• [7] Cho J, Wang Y, Chen R, Chan KS, Swami A (2017) A survey on modeling and optimizing multi-objective systems. IEEE Comm. Surveys Tutorials 19(3):1867–1901.Crossref, Google Scholar
• [8] Clayton ER, Weber WE, Taylor BW III (1982) A goal programming approach to the optimization of multi response simulation models. IIE Trans. 14(4):282–287.Google Scholar
• [9] Curto RE, Fialkow LA (1996) Solution of the Truncated Complex Moment Problem for Flat Data, Memoirs of the American Mathematical Society, vol. 568 (American Mathematical Society, Providence, RI).Crossref, Google Scholar
• [10] Curto RE, Fialkow LA (2005) Truncated k-moment problems in several variables. J. Operator Theory 54(1):189–226.Google Scholar
• [11] Donoso Y, Fabregat R (2016) Multi-Objective Optimization in Computer Networks Using Metaheuristics (CRC Press, Boca Raton, FL).Crossref, Google Scholar
• [12] Emmerich MT, Deutz AH (2018) A tutorial on multiobjective optimization: Fundamentals and evolutionary methods. Nat. Comput. 17:585–609.Crossref, Google Scholar
• [13] Fan J, Nie J, Zhou A (2018) Tensor eigenvalue complementarity problems. Math. Program. 170:507–539.Crossref, Google Scholar
• [14] Fleming PJ (1986) Computer aided design of regulators using multiobjective optimization. Di Pillo G, ed. Control Applications of Nonlinear Programming and Optimization (Elsevier, Amsterdam), 47–52.Crossref, Google Scholar
• [15] Geiger MJ, Sevaux M (2011) The biobjective inventory routing problem–problem solution and decision support. INOC 2011 Internat. Conf. Network Optim. (Springer, Berlin, Heidelberg), 365–378.Google Scholar
• [16] Guo F, Wang L, Zhou G (2014) Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities. J. Global Optim. 58:261–284.Crossref, Google Scholar
• [17] Helton JW, Nie J (2010) Semidefinite representation of convex sets. Math. Program. 122:21–64.Crossref, Google Scholar
• [18] Henrion D, Lasserre JB (2005) Detecting global optimality and extracting solutions in GloptiPoly. Henrion D, Garulli A, eds. Positive Polynomials in Control (Springer, Berlin, Heidelberg), 293–310.Crossref, Google Scholar
• [19] Henrion D, Lasserre JB, Löfberg J (2009) GloptiPoly 3: Moments, optimization and semidefinite programming. Optim. Methods Software 24(4–5):761–779.Crossref, Google Scholar
• [20] Huang L, Nie J, Yuan YX (2023a) Homogenization for polynomial optimization with unbounded sets. Math. Program. 200(1):105–145.Crossref, Google Scholar
• [21] Huang L, Nie J, Yuan YX (2023b) Generalized truncated moment problems with unbounded sets. J. Sci. Comput. 95(1):15.Crossref, Google Scholar
• [22] Jahn J (2009) Vector Optimization: Theory, Applications, and Extensions (Springer, Berlin, Heidelberg).Google Scholar
• [23] Jiao L, Lee JH (2021) Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. Ann. Oper. Res. 296(1–2):803–820.Crossref, Google Scholar
• [24] Jiao L, Lee JH, Zhou Y (2020b) A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials. Oper. Res. Lett. 48(2):188–194.Crossref, Google Scholar
• [25] Jiao L, Lee JH, Ogata Y, Tanaka T (2020a) Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint. Taiwanese J. Math. 24(4):1021–1043.Crossref, Google Scholar
• [26] Jones D, Tamiz M (2010) Practical Goal Programming, International Series in Operations Research & Management Science, vol. 141 (Springer, New York).Crossref, Google Scholar
• [27] Kim DS, Pham TS, Tuyen NV (2019) On the existence of Pareto solutions for polynomial vector optimization problems. Math. Program. 177(1–2):321–341.Crossref, Google Scholar
• [28] Koski J, Silvennoinen R (1987) Norm methods and partial weighting in multicriterion optimization of structures. Internat. J. Numer. Methods Engrg. 24(6):1101–1121.Crossref, Google Scholar
• [29] Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3):796–817.Crossref, Google Scholar
• [30] Lasserre JB (2008) A semidefinite programming approach to the generalized problem of moments. Math. Program. 112:65–92.Crossref, Google Scholar
• [31] Lasserre JB (2009) Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19(4):1995–2014.Crossref, Google Scholar
• [32] Lasserre JB (2015) An Introduction to Polynomial and Semi-Algebraic Optimization, Cambridge Texts in Applied Mathematics, vol. 52 (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [33] Lasserre JB (2018) The moment-SOS hierarchy. Sirakov B, Ney de Souza P, Viana M, eds. Proc. Internat. Congress Math. ICM 2018 (World Scientific, Singapore), 3773–3794.Google Scholar
• [34] Laurent M (2005) Revisiting two theorems of Curto and Fialkow on moment matrices. Proc. Amer. Math. Soc. 133(10):2965–2976.Crossref, Google Scholar
• [35] Laurent M (2009) Sums of squares, moment matrices and optimization over polynomials. Putinar M, Sullivant S, eds. Emerging Applications of Algebraic Geometry (Springer, New York), 157–270.Crossref, Google Scholar
• [36] Laurent M (2014) Optimization over polynomials: Selected topics. Jang SY, Kim YR, Lee D-W, Yie I, eds. Proc. Internat. Congress Mathematicians 2014 (Kyung Moon SA Co. Ltd., Seoul), 843–869.Google Scholar
• [37] Lee JH, Jiao L (2018) Solving fractional multicriteria optimization problems with sum of squares convex polynomial data. J. Optim. Theory Appl. 176:428–455.Crossref, Google Scholar
• [38] Lee JH, Sisarat N, Jiao L (2021) Multi-objective convex polynomial optimization and semidefinite programming relaxations. J. Global Optim. 80(1):117–138.Crossref, Google Scholar
• [39] Liu DY, Hu R, Fang YP (2023) Solvability of a regular polynomial vector optimization problem without convexity. Optimization 72(3):821–841.Crossref, Google Scholar
• [40] Magron V, Henrion D, Lasserre JB (2014) Approximating Pareto curves using semidefinite relaxations. Oper. Res. Lett. 42(6–7):432–437.Crossref, Google Scholar
• [41] Magron V, Henrion D, Lasserre JB (2015) Semidefinite approximations of projections and polynomial images of semialgebraic sets. SIAM J. Optim. 25(4):2143–2164.Crossref, Google Scholar
• [42] Mai N, Lasserre JB, Magron V (2022) Positivity certificates and polynomial optimization on non-compact semialgebraic sets. Math. Program. 194:443–485.Crossref, Google Scholar
• [43] Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Structural Multidisciplinary Optim. 26:369–395.Crossref, Google Scholar
• [44] Matsatsinis NF, Delias P (2003) AgentAllocator: An agent-based multi-criteria decision support system for task allocation. Mařík V, McFarlane D, Valckenaers P, eds. HoloMAS 2003 Internat. Conf. Indust. Appl. Holonic Multi-Agent Systems (Springer, Berlin, Heidelberg), 225–235.Google Scholar
• [45] Miettinen K (1999) Nonlinear Multiobjective Optimization, International Series in Operations Research & Management Science, vol. 12 (Springer Science & Business Media, New York).Google Scholar
• [46] Nie J (2011) Polynomial matrix inequality and semidefinite representation. Math. Oper. Res. 36(3):398–415.Link, Google Scholar
• [47] Nie J (2012) Discriminants and nonnegative polynomials. J. Symbolic Comput. 47(2):167–191.Crossref, Google Scholar
• [48] Nie J (2013) Certifying convergence of Lasserre’s hierarchy via flat truncation. Math. Program. 142:485–510.Crossref, Google Scholar
• [49] Nie J (2014) Optimality conditions and finite convergence of Lasserre’s hierarchy. Math. Program. 146:97–121.Crossref, Google Scholar
• [50] Nie J (2015) Linear optimization with cones of moments and nonnegative polynomials. Math. Program. 153:247–274.Crossref, Google Scholar
• [51] Nie J (2017) Generating polynomials and symmetric tensor decompositions. Found. Comput. Math. 17:423–465.Crossref, Google Scholar
• [52] Nie J (2019) Tight relaxations for polynomial optimization and Lagrange multiplier expressions. Math. Program. 178:1–37.Crossref, Google Scholar
• [53] Nie J, Zhang X (2018) Real eigenvalues of nonsymmetric tensors. Comput. Optim. Appl. 70(1):1–32.Crossref, Google Scholar
• [54] Nie J, Yang Z, Zhou G (2022) The saddle point problem of polynomials. Found. Comput. Math. 22:1133–1169.Crossref, Google Scholar
• [55] Putinar M (1993) Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3):969–984.Crossref, Google Scholar
• [56] Rosenthal S, Borschbach M (2017) Design perspectives of an evolutionary process for multi-objective molecular optimization. Trautmann H, Rudolph G, Klamroth K, Schütze O, Wiecek M, Jin Y, Grimme C, eds. EMO 2017 Internat. Conf. Evolutionary Multi-Criterion Optim. (Springer, Cham, Switzerland), 529–544.Google Scholar
• [57] Ruíz-Canales P, Rufián-Lizana A (1995) A characterization of weakly efficient points. Math. Program. 68(1–3):205–212.Crossref, Google Scholar
• [58] van der Horst E, Marqués-Gallego P, Mulder-Krieger T, Veldhoven JV, Kruisselbrink J, Aleman A, Emmerich MT et al. (2012) Multi-objective evolutionary design of adenosine receptor ligands. J. Chem. Inform. Model. 52(7):1713–1721.Crossref, Google Scholar
• [59] Wang P, Emmerich M, Li R, Tang K, Bäck T, Yao X (2014) Convex hull-based multiobjective genetic programming for maximizing receiver operating characteristic performance. IEEE Trans. Evol. Comput. 19(2):188–200.Crossref, Google Scholar
• [60] Zionts S (1989) Multiple criteria mathematical programming: An updated overview and several approaches. Karpak B, Zionts S, eds. Multiple Criteria Decision Making and Risk Analysis Using Microcomputers (Springer, Berlin, Heidelberg), 7–60.Crossref, Google Scholar