Pages that link to "Item:Q5963686"
From MaRDI portal
The following pages link to Strong duality in lasserre's hierarchy for polynomial optimization (Q5963686):
Displayed 25 items.
- An improved semidefinite programming hierarchy for testing entanglement (Q529619) (← links)
- Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Convergence of Lasserre's hierarchy: the general case (Q2119755) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- On decompositions and approximations of conjugate partial-symmetric tensors (Q2240646) (← links)
- Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors (Q2422614) (← links)
- Exploiting sparsity for semi-algebraic set volume computation (Q2696572) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
- SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
- Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution (Q5088656) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- Computing the Hausdorff Boundary Measure of Semialgebraic Sets (Q5130991) (← links)
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization (Q5233101) (← links)
- A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
- On the effective Putinar's Positivstellensatz and moment approximation (Q6044976) (← links)
- A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials (Q6181366) (← links)
- Lagrangian duality in convex conic programming with simple proofs (Q6200791) (← links)