Pages that link to "Item:Q481041"
From MaRDI portal
The following pages link to On polynomial optimization over non-compact semi-algebraic sets (Q481041):
Displaying 26 items.
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs (Q1785391) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials (Q2230937) (← links)
- Polynomial optimization on some unbounded closed semi-algebraic sets (Q2275290) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- On the existence of Pareto solutions for polynomial vector optimization problems (Q2316622) (← links)
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints (Q2363578) (← links)
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (Q2796798) (← links)
- Optimizing a linear function over a noncompact real algebraic variety (Q2819709) (← links)
- Optimization problems over noncompact semialgebraic sets (Q2819731) (← links)
- (Q4557933) (← links)
- Coercive polynomials: stability, order of growth, and Newton polytopes (Q4613988) (← links)
- Coercive Polynomials and Their Newton Polytopes (Q5502243) (← links)
- On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)
- Tangencies and polynomial optimization (Q6038670) (← links)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- Convergences for robust bilevel polynomial programmes with applications (Q6078425) (← links)
- Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method (Q6082663) (← links)
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
