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… 

Multi-objective convex polynomial optimization and semidefinite programming relaxations

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.

Multi-objective convex polynomial optimization and semidefinite programming relaxations

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

On a Frank-Wolfe type theorem in cubic optimization

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

Complexity for exact polynomial optimization strengthened with Fritz John conditions

Let f, g 1 , . . . , g m be polynomials of degree at most d with real coefficients in a vector of variables x = ( x 1 , . . . , x n ). Assume that f is non-negative on the basic semi-algebraic set S

Semi-algebraic description of the closure of the image of a semi-algebraic set under a polynomial

  • N. Mai
  • Mathematics, Computer Science
  • 2022
It is proved that every polynomial optimization problem whose optimum value is finite 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 define f ( S ).

References

SHOWING 1-10 OF 33 REFERENCES

A Frank–Wolfe type theorem for nondegenerate polynomial programs

If f0 is bounded from below on S, then f0 attains its infimum on S and f_0, the optimal solution to the constrained polynomial optimization problem, is studied.

Minima of Functions of Several Variables with Inequalities as Side Conditions

The problem of determining necessary conditions and sufficient conditions for a relative minimum of a function \( f({x_1},{x_2},....,{x_n})\) in the class of points \( x = ({x_1},{x_2},....,{x_n})\)

Well-Posedness in Unconstrained Polynomial Optimization Problems

There exists an open and dense semialgebraic set $\mathcal{U}_{\Gamma}$ in the corresponding Euclidean space of data such that for every polynomial f, which is bounded from below on R, the problem of minimization of f over R is strongly well-posed.

Global Hölderian Error Bound for Nondegenerate Polynomials

It is proved that if f is convenient and nondegenerate with respect to its Newton boundary at infinity in the sense of Kouchnirenko, then it has a global Holderian error bound.

On Extensions of the Frank-Wolfe Theorems

This paper first proves a general continuity result for the solution set defined by a system of convex quadratic inequalities, and proves that the optimal solution set is nonempty.

On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes

It is proved that the optimal solution set of the considered problem is nonempty, this way extending the attainability result well known as the so-called Frank-Wolfe theorem.

Coercive Polynomials and Their Newton Polytopes

This article analyzes the coercivity on f in $\mathbb{R}^n$ of multivariate polynomials in terms of their so-called Newton polytopes at infinity in the broad class ofSo-called gem regular polynoms and characterize their coercivity via conditions solely containing information about the geometry of the vertex set of the Newton polytope at infinity, as well as sign conditions on the corresponding polynomial coefficients.

On the bifurcation set of a polynomial function and Newton boundary, II

Let /: C-*C be a polynomial function. It is well known that there exists a finite set TgC, such that /: C\f-(F^C\r is a locally trivial fibration (see [1], [5], [13], [15], [16]). The smallest such

A Frank–Wolfe Type Theorem for Convex Polynomial Programs

It is shown that an arbitrary quadratic function f attains its minimum over a nonempty convex polyhedral set X provided f is bounded from below over X and that a similar statement holds if f is a convex polynomial and X is the solution set of a system of convexPolynomial inequalities.