GloptiPoly 3: moments, optimization and semidefinite programming
From MaRDI portal
Publication:3396396
Abstract: We describe a major update of our Matlab freeware GloptiPoly for parsing generalized problems of moments and solving them numerically with semidefinite programming.
Cited in
(only showing first 100 items - show all)- An algorithm for semi-infinite polynomial optimization
- Nonlinear \(H_\infty\) output feedback control with integrator for polynomial discrete-time systems
- Signomial and polynomial optimization via relative entropy and partial dualization
- A semidefinite method for tensor complementarity problems
- Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem
- Nonstationary LPV control for trajectory tracking: a double pendulum example
- Min-max and robust polynomial optimization
- A convex optimization model for finding non-negative polynomials
- The tracial moment problem and trace-optimization of polynomials
- Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems
- The saddle point problem of polynomials
- Formal Proofs for Nonlinear Optimization
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Minimizing the sum of many rational functions
- 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
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Stochastic polynomial optimization
- Higher-degree tensor eigenvalue complementarity problems
- An efficient DC programming approach for portfolio decision with higher moments
- A polynomial optimization approach to constant rebalanced portfolio selection
- Dehomogenization for completely positive tensors
- Distributionally robust optimization with moment ambiguity sets
- An SDP relaxation method for Perron pairs of a nonnegative tensor
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
- Conic programming: infeasibility certificates and projective geometry
- 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
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- 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
- A regularization-patching dual quaternion optimization method for solving the hand-eye calibration problem
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Positivity and optimization: beyond polynomials
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Discriminants and nonnegative polynomials
- Alternating direction method of multipliers for real and complex polynomial optimization models
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Tensor eigenvalue complementarity problems
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Rational Generalized Nash Equilibrium Problems
- Local saddle points for unconstrained polynomial optimization
- A utopia point method-based robust vector polynomial optimization scheme
- Hausdorff distance between convex semialgebraic sets
- (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
- Generalized truncated moment problems with unbounded sets
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Saddle points of rational functions
- Moment-SoS methods for optimal transport problems
- Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra
- Real eigenvalues of nonsymmetric tensors
- Tensor maximal correlation problems
- Homogenization for polynomial optimization with unbounded sets
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- On new classes of nonnegative symmetric tensors
- Convex underestimators of polynomials
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- Test of copositive tensors
- Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- A robust unscented transformation for uncertain moments
- On the complexity of computing the handicap of a sufficient matrix
- 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
- Computing generalized Nash equilibria by polynomial programming
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Algebraic optimization of sequential decision problems
- A modified FR conjugate gradient method for computing \(Z\)-eigenpairs of symmetric tensors
- Gposolver: a Matlab/C++ toolbox for global polynomial optimization
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Computing the distance between the linear matrix pencil and the completely positive cone
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- Completely positive tensor recovery with minimal nuclear value
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- A globally convergent method for solving a quartic generalized Markowitz portfolio problem
- Tensor \(Z\)-eigenvalue complementarity problems
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- Lower bounds for cubic optimization over the sphere
- On the synthesis of linear H_ filters for polynomial systems
This page was built for publication: GloptiPoly 3: moments, optimization and semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396396)
