Pages that link to "Item:Q5470206"
From MaRDI portal
The following pages link to Semidefinite Approximations for Global Unconstrained Polynomial Optimization (Q5470206):
Displaying 25 items.
- A Frank-Wolfe type theorem for nondegenerate polynomial programs (Q463745) (← links)
- On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369) (← links)
- Unconstrained and constrained global optimization of polynomial functions in one variable (Q1187372) (← links)
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations (Q2029007) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems (Q2396463) (← links)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- An alternative approach for nonlinear optimal control problems based on the method of moments (Q2457954) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- SDP Relaxations for Non-Commutative Polynomial Optimization (Q2802540) (← links)
- Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
- Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems (Q3590027) (← links)
- (Q4963653) (← links)
- Generic Properties for Semialgebraic Programs (Q5363376) (← links)
- Well-Posedness in Unconstrained Polynomial Optimization Problems (Q5741069) (← links)
