Spectral methods for polynomial optimization
From MaRDI portal
Cites work
- A feasible method for optimization with orthogonality constraints
- A hierarchy of spectral relaxations for polynomial optimization
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- A new sparse SOS decomposition algorithm based on term sparsity
- A Positivstellensatz for sums of nonnegative circuit polynomials
- A Spectral Bundle Method for Semidefinite Programming
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
- A unified framework of SAGE and SONC polynomials and its duality theory
- An introduction to polynomial and semi-algebraic optimization
- ARPACK Users' Guide
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- CVXPY: a Python-embedded modeling language for convex optimization
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Global optimization with polynomials and the problem of moments
- Harmonic Hierarchies for Polynomial Optimization
- scientific article; zbMATH DE number 1120551 (Why is no real title available?)
- LAPACK Users' Guide
- Moments, positive polynomials and their applications
- msolve. A library for solving polynomial systems
- Newton polytopes and relative entropy optimization
- Polynomial optimization, sums of squares, and applications
- Positive polynomials and sums of squares
- Procrustes Problems
- Reducibility among combinatorial problems
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Relative entropy relaxations for signomial optimization
- Rotation averaging
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite programming relaxations for semialgebraic problems
- Signomial and polynomial optimization via relative entropy and partial dualization
- Some applications of polynomial optimization in operations research and real-time decision making
- Some NP-complete problems in quadratic and nonlinear programming
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Spectrahedral Regression
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Symmetry groups, semidefinite programs, and sums of squares
- Tensor theta norms and low rank recovery
- The Geometry of Algorithms with Orthogonality Constraints
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory
- Theta bodies for polynomial ideals
- Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
This page was built for publication: Spectral methods for polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305214)
