The set of polynomials that are nonnegative over a subset of the nonnegative orthant (we call them set-semidefinite) have many uses in optimization. A common example of this type set is the set of copositive matrices, where we are effectively considering nonnegativity over the entire nonnegative orthant and are restricted to homogeneous polynomials of degree two. Lasserre (SIAM J. Optim., 21(3):864-885, 2011) has previously considered a method using moments in order to provide an outer approximation to this set, for nonnegativity over a general subset of the real space. In this paper, we shall show that, in the special case of considering nonnegativity over a subset of the nonnegative orthant, we can provide a new outer approximation hierar...
In this article we present the moment based approach for computing all real solutions of a given sys...
The generalized problem of moments is a conic linear optimization problem over the convex cone of po...
The generalized problem of moments is a conic linear optimization problem over the convex cone of po...
The set of polynomials that are nonnegative over a subset of the nonnegative orthant (we call them s...
The set of polynomials that are nonnegative over a subset of the nonnegative orthant (we call them s...
International audienceWe first show that a continuous function f is nonnegative on a closed set $K\s...
International audienceWe first show that a continuous function f is nonnegative on a closed set $K\s...
We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial eq...
We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial eq...
Many important applications in global optimization, algebra, probability and statistics, applied mat...
This thesis is dedicated to investigations of the moment-sums-of-squares hierarchy, a family of semi...
This thesis is dedicated to investigations of the moment-sums-of-squares hierarchy, a family of semi...
In this chapter we present the moment based approach for computing all real solutions of a given sys...
This thesis is dedicated to investigations of the moment-sums-of-squares hierarchy, a family of semi...
In this article we present the moment based approach for computing all real solutions of a given sys...
In this article we present the moment based approach for computing all real solutions of a given sys...
The generalized problem of moments is a conic linear optimization problem over the convex cone of po...
The generalized problem of moments is a conic linear optimization problem over the convex cone of po...
The set of polynomials that are nonnegative over a subset of the nonnegative orthant (we call them s...
The set of polynomials that are nonnegative over a subset of the nonnegative orthant (we call them s...
International audienceWe first show that a continuous function f is nonnegative on a closed set $K\s...
International audienceWe first show that a continuous function f is nonnegative on a closed set $K\s...
We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial eq...
We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial eq...
Many important applications in global optimization, algebra, probability and statistics, applied mat...
This thesis is dedicated to investigations of the moment-sums-of-squares hierarchy, a family of semi...
This thesis is dedicated to investigations of the moment-sums-of-squares hierarchy, a family of semi...
In this chapter we present the moment based approach for computing all real solutions of a given sys...
This thesis is dedicated to investigations of the moment-sums-of-squares hierarchy, a family of semi...
In this article we present the moment based approach for computing all real solutions of a given sys...
In this article we present the moment based approach for computing all real solutions of a given sys...
The generalized problem of moments is a conic linear optimization problem over the convex cone of po...
The generalized problem of moments is a conic linear optimization problem over the convex cone of po...