GloptiPoly
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An algorithm for the global optimization of a class of continuous minimax problems
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Global optimization of robust chance constrained problems
- An efficient algorithm for range computation of polynomials using the Bernstein form
- A generalized flat extension theorem for moment matrices
- A heuristic for nonlinear global optimization
- OptimaRegion
- RAGlib
- Sageopt
- Sostools
- SYNRAC
- LFTB
- GLOPTLAB
- SDPA
- SeDuMi
- VSDP
- SDPT3
- jReality
- Completely positive tensor recovery with minimal nuclear value
- veDYNA
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- On calculation of norms of 2D-systems
- SparsePOP
- PENNON
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- GDToolkit
- RealPaver
- DSDP5
- SimpleS
- Padua2D
- Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach
- Two variants of the PMHSS iteration method for a class of complex symmetric indefinite linear systems
- Tensor eigenvalue complementarity problems
- An obstacle avoidance model predictive control scheme for mobile robots subject to nonholonomic constraints: a sum-of-squares approach
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- CVX
- YALMIP
- Mosek
- azove
- UTA-poly and UTA-splines: additive value functions with polynomial marginals
- RoMulOC
- SDLS
- SFSDP
- Algorithms for the orthographic-\(n\)-point problem
- pyipopt
- Surf
- (Sub-)differentiability of probability functions with elliptical distributions
- Optimal control of switching topology networks
- LMITOOL
- Approximate optimal designs for multivariate polynomial regression
- POCP
- Degeneracy of the intersection of three quadrics
- A robust unscented transformation for uncertain moments
- csminwel
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra
- Real eigenvalues of nonsymmetric tensors
- Tensor maximal correlation problems
- An improved semidefinite programming relaxation for the satisfiability problem
- Inverse conic programming with applications
- Approximating Pareto curves using semidefinite relaxations
- A MAX-CUT formulation of 0/1 programs
- Plane-based resection for metric affine cameras
- LMI toolbox
- Axel
- Wiener-Hammerstein Benchmark
- Cabri 3D
- SnapPea
- simpcomp
- NCSOStools
- RACT
- HALCON
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- A ``joint + marginal heuristic for 0/1 programs
- A semidefinite approach for truncated \(K\)-moment problems
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- An algorithm for semi-infinite polynomial optimization
- The moment problem for continuous positive semidefinite linear functionals
- Robotics
- An exact Jacobian SDP relaxation for polynomial optimization
- The tracial moment problem and trace-optimization of polynomials
- Convex underestimators of polynomials
- SDPARA
- NCAlgebra
- Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms
- CERR
- Robust Control Toolbox
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Conic programming: infeasibility certificates and projective geometry
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- AQCS
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- Tensor \(Z\)-eigenvalue complementarity problems
- Lower bounds for cubic optimization over the sphere
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
This page was built for software: GloptiPoly
