Optimality Conditions for Minimizers at Infinity in Polynomial Programming

References

• [1] Andronov VG, Belousov EG, Shironin VM (1982) On solvability of the problem of polynomial programming. Izvestija Akadem. Nauk SSSR, Tekhnicheskaja Kibernetika (in Russian) 4:194–197.Google Scholar
• [2] Bajbar T, Stein O (2015) Coercive polynomials and their Newton polytopes. SIAM J. Optim. 25(3):1542–1570.Crossref, Google Scholar
• [3] Bank B, Mandel R (1988) Parametric Integer Optimization, vol. 39 (Mathematical Research, Academie-Verlag, Berlin).Google Scholar
• [4] Belousov EG (1977) Introduction to Convex Analysis and Integer Programming (Moscow University Publ., Moscow) (in Russian).Google Scholar
• [5] Belousov EG, Klatte D (2002) A Frank–Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22(1):37–48.Crossref, Google Scholar
• [6] Bertsekas D (1999) Nonlinear Programming (Athena Scientific Publishers, Belmont, MA).Google Scholar
• [7] Bertsekas DP, Tseng P (2007) Set intersection theorems and existence of optimal solutions. Math. Programming Ser. A 110(2):287–314.Crossref, Google Scholar
• [8] Bochnak J, Coste M, Roy MF (1998) Real Algebraic Geometry, vol. 36 (Springer, Berlin).Crossref, Google Scholar
• [9] Bolte J, Hochart A, Pauwels E (2018) Qualification conditions in semi-algebraic programming. SIAM J. Optim. 28(3):2131–2151.Crossref, Google Scholar
• [10] Clarke FH (1990) Optimization and Nonsmooth Analysis (SIAM, Philadelphia).Crossref, Google Scholar
• [11] Dinh ST, Hà HV, Phạm TS (2014) A Frank–Wolfe type theorem for nondegenerate polynomial programs. Math. Programming Ser. A 147(1/2):519–538.Crossref, Google Scholar
• [12] Doat DV, Hà HV, Phạm TS (2016) Well-posedness in unconstrained polynomial optimization problems. SIAM J. Optim. 26(3):1411–1428.Crossref, Google Scholar
• [13] Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res. Logist. Quart. 3(1/2):95–110.Crossref, Google Scholar
• [14] Hà HV (2013) Global Hölderian error bound for non-degenerate polynomials. SIAM J. Optim. 23(2):917–933.Crossref, Google Scholar
• [15] Hà HV, Phạm TS (2017) Genericity in Polynomial Optimization, Series on Optimization and Its Applications, vol. 3 (World Scientific, Singapore).Crossref, Google Scholar
• [16] John F (1948) Extremum problems with inequalities as side constraints. Friedrichs KO, Neugebauer OE, Stoker JJ, eds. Studies and Essays, Courant Anniversary Volume (Wiley, New York), 187–204.Google Scholar
• [17] Karush W (1939) Minima of functions of several variables with inequalities as side constraints. Master’s thesis, University of Chicago, Chicago.Google Scholar
• [18] Kouchnirenko AG (1976) Polyhèdres de Newton et nombre de Milnor. Inventiones Mathematicae 32(1):1–31.Crossref, Google Scholar
• [19] Kuhn HW, Tucker AW (1951) Nonlinear programming. Neyman J, ed. Proc. 2nd Berkeley Sympos. (University of California Press, Berkeley), 481–492.Google Scholar
• [20] Lasserre JB (2015) An Introduction to Polynomial and Semi-Algebraic Optimization (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [21] Luo ZQ, Zhang S (1999) On extensions of the Frank–Wolfe theorems. Comput. Optim. Appl. 13(1–3):87–110.Crossref, Google Scholar
• [22] Mangasarian OL, Fromovitz S (1967) The Fritz John necessary optimality conditions in the presence of equality and inequality constraints. J. Math. Anal. Appl. 17(1):37–47.Crossref, Google Scholar
• [23] Mawhin J, Willem M (2010) Origin and evolution of the Palais–Smale condition in critical point theory. J. Fixed Point Theory Appl. 7(2):265–290.Crossref, Google Scholar
• [24] Mordukhovich BS (2006) Variational Analysis and Generalized Differentiation, I: Basic Theory; II: Applications (Springer, Berlin).Google Scholar
• [25] Némethi A, Zaharia A (1990) On the bifurcation set of a polynomial function and Newton boundary. Publications RIMS 26(4):681–689.Crossref, Google Scholar
• [26] Nie J, Demmel J, Sturmfels B (2006) Minimizing polynomials via sum of squares over the gradient ideal. Math. Programming Ser. A 106(3):587–606.Crossref, Google Scholar
• [27] Obuchowska WT (2006) On generalizations of the Frank–Wolfe theorem to convex and quasi-convex programmes. Comput. Optim. Appl. 33(2/3):349–364.Crossref, Google Scholar
• [28] Perold AF (1980) Generalization of the Frank–Wolfe theorem. Math. Programming 18(1):215–227.Crossref, Google Scholar
• [29] Terlaky T (1985) On l_{p} programming. Euro. J. Oper. Res. 22(1):70–100.Crossref, Google Scholar