Polynomial optimization in geometric modeling
From MaRDI portal
Cites work
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 1813012 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Loraine – an interior-point solver for low-rank semidefinite programming
- Minimum-volume ellipsoids. Theory and algorithms
- On the effective Putinar's Positivstellensatz and moment approximation
- On the Nesterov--Todd Direction in Semidefinite Programming
- Optimization of Polynomials on Compact Semialgebraic Sets
- Polynomial-exponential decomposition from moments
- Structured low rank decomposition of multivariate Hankel matrices
This page was built for publication: Polynomial optimization in geometric modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979704)