# Optimality Conditions for Minimizers at Infinity in Polynomial Programming

@article{Pham2017OptimalityCF,
title={Optimality Conditions for Minimizers at Infinity in Polynomial Programming},
author={Tien Son Pham},
journal={Math. Oper. Res.},
year={2017},
volume={44},
pages={1381-1395}
}
• T. Pham
• Published 1 June 2017
• Mathematics
• Math. Oper. Res.
In this paper we study necessary optimality conditions for the optimization problem $$\textrm{infimum}f_0(x) \quad \textrm{ subject to } \quad x \in S,$$ where $f_0 \colon \mathbb{R}^n \rightarrow \mathbb{R}$ is a polynomial function and $S \subset \mathbb{R}^n$ is a set defined by polynomial inequalities. Assume that the problem is bounded below and has the Mangasarian--Fromovitz property at infinity. We first show that if the problem does {\em not} have an optimal solution, then a version at…
5 Citations
• Mathematics, Computer Science
J. Glob. Optim.
• 2021
It is shown that finding efficient solutions to problem (MP) can be achieved successfully by solving hierarchies of semidefinite programming relaxations and checking a flat truncation condition.
• Materials Science
Journal of Global Optimization
• 2021
This paper aims to find efficient solutions to a multi-objective optimization problem (MP) with convex polynomial data. To this end, a hybrid method, which allows us to transform problem (MP) into a
ABSTRACT A classical result due to Frank and Wolfe [An algorithm for quadratic programming. Naval Res Log Quart. 1956;3:95–110] says that a quadratic function f attains its supremum on a nonempty
Let f, g 1 , . . . , g m be polynomials of degree at most d with real coeﬃcients in a vector of variables x = ( x 1 , . . . , x n ). Assume that f is non-negative on the basic semi-algebraic set S
• N. Mai
• Mathematics, Computer Science
• 2022
It is proved that every polynomial optimization problem whose optimum value is ﬁnite has an equivalent form with attained optimum value, i.e., whenever the right-hand side of the polynomials of degrees at most d O ( n ) that deﬁne f ( S ).