The following pages link to Sparse Polynomial Optimization (Q5088205):
Displaying 15 items.
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
- Synthesis for Polynomial Lasso Programs (Q2938082) (← links)
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
- Sparse polynomial prediction (Q6080698) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization (Q6136658) (← links)
- Complexity of sparse polynomial solving 2: renormalization (Q6171578) (← links)
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
- The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)
- State polynomials: positivity, optimization and nonlinear Bell inequalities (Q6608047) (← links)
- Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxations (Q6621506) (← links)
- Book review of: T. Theobald, Real algebraic geometry and optimization (Q6646761) (← links)
- Convergence rates for sums-of-squares hierarchies with correlative sparsity (Q6665388) (← links)
