Pages that link to "Item:Q2655337"
From MaRDI portal
The following pages link to Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337):
Displaying 11 items.
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- Synthesis for Polynomial Lasso Programs (Q2938082) (← links)
- (Q3358135) (← links)
- (Q3632452) (← links)
- (Q3819900) (← links)
- Optimal Data Fitting: A Moment Approach (Q4555461) (← links)
- Numerical method for solving polynomial minimax problem (Q5143909) (← links)
- Semidefinite programming relaxations for linear semi-infinite polynomial programming (Q5151640) (← links)
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence (Q5219695) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
- Approximation hierarchies for copositive cone over symmetric cone and their comparison (Q6122328) (← links)