swMATH29134MaRDI QIDQ40848FDOQ40848
Author name not available (Why is that?)
Official website: http://aaa.princeton.edu/software
Source code repository: https://github.com/spot-toolbox/spotless
Cited In (only showing first 100 items - show all)
- Stability analysis and control of a class of LPV systems with piecewise constant parameters
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
- A globally asymptotically stable polynomial vector field with rational coefficients and no local polynomial Lyapunov function
- Sageopt
- Real zeros of SONC polynomials
- Some applications of polynomial optimization in operations research and real-time decision making
- A multilevel analysis of the Lasserre hierarchy
- Polyhedral approximations of the semidefinite cone and their application
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
- Augmented finite transition systems as abstractions for control synthesis
- The convex hull of a quadratic constraint over a polytope
- DC decomposition of nonconvex polynomials with algebraic techniques
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Alternative SDP and SOCP approximations for polynomial optimization
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- A robust unscented transformation for uncertain moments
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- A survey on conic relaxations of optimal power flow problem
- Distance geometry and data science
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- VSDP
- GloptiPoly
- Mosek
- YALMIP
- SparseCoLO
- NCSOStools
- Robotics
- SDPARA
- EDIM
- MD-jeep
- GraphGen
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
- FLO
- SMRSOFT
- SDPNAL+
- QuadProgBB
- SOSOPT
- GpoSolver
- SCIP-SDP
- SCS
- Ncpol2sdpa
- SPOT
- POEM
- QSDPNAL
- NESTA
- MIQCR-CB
- On polyhedral approximations of the positive semidefinite cone
- ParetoImageSDP
- BBCPOP
- PhaseCut
- Optimal-SPCA
- WMINCON
- Sieve-SDP
- Sparse-BSOS
- Pajarito
- PGLib-OPF
- frlib
- StdPooling-PolyAlgos
- TSSOS
- MSCRA_rankmin
- HybridSystemsLab
- SparseJSR
- Synthesizing robust domains of attraction for state-constrained perturbed polynomial systems
- Optimization over structured subsets of positive semidefinite matrices via column generation
- A bounded degree SOS hierarchy for polynomial optimization
- Newton polytopes and relative entropy optimization
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mathematical programming formulations for the alternating current optimal power flow problem
- REPOP
- A new approximation hierarchy for polynomial conic optimization
- Polynomial norms
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Sum of squares approach for nonlinear \(\operatorname{H}_\infty\) control
- A multiple-comparison-systems method for distributed stability analysis of large-scale nonlinear systems
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- On sums of squares of \(K\)-nomials
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- A unified framework of SAGE and SONC polynomials and its duality theory
- Region of attraction analysis of nonlinear stochastic systems using polynomial chaos expansion
- Bounding extrema over global attractors using polynomial optimisation
- Sparse PSD approximation of the PSD cone
- A note on convex relaxations for the inverse eigenvalue problem
- Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
- Diagonally dominant programming in distance geometry
- Robust estimations of the region of attraction using invariant sets
- Nonnegative Polynomials and Circuit Polynomials
- Maximum feasible subsystems of distance geometry constraints
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Sum-of-squares optimization without semidefinite programming
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
- Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings
- A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems
- Bounding extreme events in nonlinear dynamics using convex optimization
- A Lagrange multiplier expression method for bilevel polynomial optimization
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
This page was built for software: SPOTless
