Cited in
(97)- Global optimization of polynomials restricted to a smooth variety using sums of squares
- Solutions of polynomial systems derived from the steady cavity flow problem (extended abstract).
- The tracial moment problem and trace-optimization of polynomials
- Minimizing the sum of many rational functions
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- A polynomial optimization approach to constant rebalanced portfolio selection
- An extension of the elimination method for a sparse SOS polynomial
- A multilevel analysis of the Lasserre hierarchy
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- Recognizing underlying sparsity in optimization
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- Polynomial optimization for water networks: global solutions for the valve setting problem
- Alternative SDP and SOCP approximations for polynomial optimization
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- A robust unscented transformation for uncertain moments
- Facial reduction algorithms for conic optimization problems
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Reconstruction of convex bodies from moments
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Set-membership errors-in-variables identification of MIMO linear systems
- Sum of squares method for sensor network localization
- Moments, positive polynomials and their applications
- Exploiting structured sparsity in large scale semidefinite programming problems
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Bounding the parameters of block-structured nonlinear feedback systems
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Solving partial differential equations via sparse SDP relaxations
- A new updating method for the damped mass-spring systems
- Maximum block improvement and polynomial optimization
- Sostools
- SDPA
- SeDuMi
- SDPT3
- GloptiPoly
- DSDP5
- SFSDP
- SparseCoLO
- csminwel
- LMBM
- MULKNAP
- Wiener-Hammerstein Benchmark
- NCSOStools
- NCAlgebra
- SDPARA
- Intsolver
- NLCertify
- Ncpol2sdpa
- SPOT
- RLT-POS
- BiqCrunch
- LightGraphs.jl
- SPOTless
- BBCPOP
- Sparse-BSOS
- TSSOS
- ChordalGraph
- SparseJSR
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Algorithm 996
- The minimum-rank Gram matrix completion via modified fixed point continuation method
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- RAPOSa
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Introduction to semidefinite, conic and polynomial optimization
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Solving polynomial least squares problems via semidefinite programming relaxations
- Bounded error identification of Hammerstein systems through sparse polynomial optimization
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- GloptiPoly 3: moments, optimization and semidefinite programming
- REPOP
- Sparse noncommutative polynomial optimization
- Exploiting term sparsity in noncommutative polynomial optimization
- Deciding non-realizability of oriented matroids by semidefinite programming
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- One-shot set-membership identification of generalized Hammerstein-Wiener systems
- An introduction to polynomial and semi-algebraic optimization
- Verifying competitive equilibria in dynamic economies
- scientific article; zbMATH DE number 5564089 (Why is no real title available?)
- Constrained polynomial optimization problems with noncommuting variables
- A facial reduction algorithm for finding sparse SOS representations
- Certification of bounds of non-linear functions: the templates method
- NLCertify: a tool for formal nonlinear optimization
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
This page was built for software: SparsePOP
