GloptiPoly
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Constrained global optimization of multivariate polynomials using polynomial B-spline form and B-spline consistency prune approach
- Approximate gcds of polynomials and sparse SOS relaxations
- Global optimization of polynomials restricted to a smooth variety using sums of squares
- An algorithm for semi-infinite polynomial optimization
- Nonlinear \(H_\infty\) output feedback control with integrator for polynomial discrete-time systems
- Computational complexity of the quantum separability problem
- Signomial and polynomial optimization via relative entropy and partial dualization
- A semidefinite method for tensor complementarity problems
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Min-max and robust polynomial optimization
- A paradox in bosonic energy computations via semidefinite programming relaxations
- LMI relaxations in robust control
- Semidefinite programming in combinatorial and polynomial optimization
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- Off-line robustification of generalized predictive control for uncertain systems
- GloptiPoly
- A convex optimization model for finding non-negative polynomials
- The tracial moment problem and trace-optimization of polynomials
- Exact relaxations of non-convex variational problems
- Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems
- POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials
- SOSTOOLS and Its Control Applications
- The saddle point problem of polynomials
- Advances in computational Lyapunov analysis using sum-of-squares programming
- Minimizing the sum of many rational functions
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- Separability of Hermitian tensors and PSD decompositions
- A discussion of probability functions and constraints from a variational perspective
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- On solving a class of fractional semi-infinite polynomial programming problems
- The maximum tensor complementarity eigenvalues
- Stochastic polynomial optimization
- Strong duality in lasserre's hierarchy for polynomial optimization
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- Higher-degree tensor eigenvalue complementarity problems
- An efficient DC programming approach for portfolio decision with higher moments
- Limits of positive flat bivariate moment matrices
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Optimization of Polynomials on Compact Semialgebraic Sets
- A polynomial optimization approach to constant rebalanced portfolio selection
- Distributionally robust optimization with moment ambiguity sets
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
- Conic programming: infeasibility certificates and projective geometry
- Computation of the Lasserre Ranks of Some Polytopes
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- A hierarchy of LMI inner approximations of the set of stable polynomials
- Comonotone and coconvex rational interpolation and approximation
- Simulation of discrete linear time-invariant fuzzy dynamic systems
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets
- Modal occupation measures and LMI relaxations for nonlinear switched systems control
- Degeneracy of the intersection of three quadrics
- Exact determinations of the maximal output admissible set for a class of nonlinear systems
- Computing sum of squares decompositions with rational coefficients
- Nonconvex robust optimization for problems with constraints
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Shear-driven planar Couette and Taylor-like instabilities for a class of compressible isotropic elastic solids
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
- Convergence of Lasserre's hierarchy: the general case
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets
- Moment Problem and Its Applications to Risk Assessment
- An improved semidefinite programming relaxation for the satisfiability problem
- Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise
- Algorithm 875
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- Positivity and optimization: beyond polynomials
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Discriminants and nonnegative polynomials
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Tensor eigenvalue complementarity problems
- Minimizer Extraction in Polynomial Optimization Is Robust
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- A semidefinite programming approach to the generalized problem of moments
- Local saddle points for unconstrained polynomial optimization
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Minimizing trigonometric matrix polynomials over semi-algebraic sets
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- An obstacle avoidance model predictive control scheme for mobile robots subject to nonholonomic constraints: a sum-of-squares approach
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- (Sub-)differentiability of probability functions with elliptical distributions
- Atomic optimization. I: Search space transformation and one-dimensional problems
- Bracketing backward reach sets of a dynamical system
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- On the complexity of Putinar's Positivstellensatz
- On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Improved parameter bounds for set-membership EIV problems
This page was built for software: GloptiPoly
