Pages that link to "Item:Q5317502"
From MaRDI portal
The following pages link to Polynomial Programming: LP-Relaxations Also Converge (Q5317502):
Displaying 17 items.
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Convergent conic linear programming relaxations for cone convex polynomial programs (Q1728215) (← links)
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets (Q2388440) (← links)
- Numerical multilinear algebra and its applications (Q2477577) (← links)
- Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
- A “Joint+Marginal” Approach in Optimization (Q2802528) (← links)
- (Q4952722) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
- LP relaxations for a class of linear semi-infinite programming problems (Q5277959) (← links)
- A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
