Semidefinite Approximations for Global Unconstrained Polynomial Optimization

Authors:
Dorina Jibetean;Monique Laurent
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
2005

Citing 0
Cited 9

On the complexity of Putinar's Positivstellensatz

Journal of Complexity
An alternative approach for non-linear optimal control problems based on the method of moments

Computational Optimization and Applications
Global minimization of rational functions and the nearest GCDs

Journal of Global Optimization
An efficient algorithm for range computation of polynomials using the Bernstein form

Journal of Global Optimization
Solving polynomial least squares problems via semidefinite programming relaxations

Journal of Global Optimization
Global optimization of polynomials using generalized critical values and sums of squares

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations

SIAM Journal on Optimization
Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets

SIAM Journal on Optimization
Strong duality and minimal representations for cone optimization

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a general (possibly infinite) system of closed convex sets in a normed linear space we provide several sufficient conditions for ensuring the strong conical hull intersection property. One set of sufficient conditions is given in terms of the finite ...