Pages that link to "Item:Q4637505"
From MaRDI portal
The following pages link to Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505):
Displayed 22 items.
- 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)
- Global optimal power flow over large-scale power transmission networks (Q1624891) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Complex orthogonal polynomials and numerical quadrature via hyponormality (Q1791083) (← links)
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? (Q2000529) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- The weirdness theorem and the origin of quantum paradoxes (Q2062465) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Exploiting sparsity in complex polynomial optimization (Q2073057) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Sum-of-squares chordal decomposition of polynomial matrix inequalities (Q2689814) (← links)
- Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023 (Q6076085) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)