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)- A complete semidefinite algorithm for detecting copositive matrices and tensors
- A ``joint + marginal heuristic for 0/1 programs
- Alternating direction method of multipliers for real and complex polynomial optimization models
- A semidefinite programming approach for solving multiobjective linear programming
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Constrained trace-optimization of polynomials in freely noncommuting variables
- A discussion of probability functions and constraints from a variational perspective
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Partially positive matrices
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
- Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
- On solving a class of fractional semi-infinite polynomial programming problems
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Signomial and polynomial optimization via relative entropy and partial dualization
- Approximate optimal designs for multivariate polynomial regression
- Computing generalized Nash equilibria by polynomial programming
- A MAX-CUT formulation of 0/1 programs
- Monotonically positive matrices
- 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
- On turnpike and dissipativity properties of continuous-time optimal control problems
- Dual form reduction in the atomic optimization method
- A semidefinite method for tensor complementarity problems
- Test of copositive tensors
- UTA-poly and UTA-splines: additive value functions with polynomial marginals
- Greedy approaches to symmetric orthogonal tensor decomposition
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Computing the Hausdorff boundary measure of semialgebraic sets
- The maximum tensor complementarity eigenvalues
- Algorithms for the orthographic-\(n\)-point problem
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- (Sub-)differentiability of probability functions with elliptical distributions
- An algorithm for semi-infinite polynomial optimization
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms
- Plane-based resection for metric affine cameras
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- Degeneracy of the intersection of three quadrics
- Formal Proofs for Nonlinear Optimization
- Semidefinite relaxations for semi-infinite polynomial programming
- Geometric and numerical methods in the contrast imaging problem in nuclear magnetic resonance
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- Completely positive tensor recovery with minimal nuclear value
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- A ``joint+marginal approach in optimization
- Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra
- Real eigenvalues of nonsymmetric tensors
- Tensor maximal correlation problems
- Bilevel polynomial programs and semidefinite relaxation methods
- On new classes of nonnegative symmetric tensors
- Hermitian completely positive matrices
- Conic programming: infeasibility certificates and projective geometry
- Semi-definite relaxations for optimal control problems with oscillation and concentration effects
- Regularized robust optimization: the optimal portfolio execution case
- Gposolver: a Matlab/C++ toolbox for global polynomial optimization
- Robust control of uncertain systems: classical results and recent developments
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Design of Marx generators as a structured eigenvalue assignment
- Three dimensional strongly symmetric circulant tensors
- Modeling probability densities with sums of exponentials via polynomial approximation
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- A robust unscented transformation for uncertain moments
- A new updating method for the damped mass-spring systems
- Nonlinear \(H_\infty\) output feedback control with integrator for polynomial discrete-time systems
- Convex underestimators of polynomials
- A generalization of Löwner-John's ellipsoid theorem
- Positivity and optimization: beyond polynomials
- The saddle point problem of polynomials
- An exact Jacobian SDP relaxation for polynomial optimization
- Copositivity and constrained fractional quadratic problems
- An efficient DC programming approach for portfolio decision with higher moments
- A semidefinite approach for truncated \(K\)-moment problems
- Finding largest small polygons with gloptipoly
- Global optimality conditions and optimization methods for polynomial programming problems
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems
- A moment approach for entropy solutions to nonlinear hyperbolic PDEs
- Moments and sums of squares for polynomial optimization and related problems
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Borel measures with a density on a compact semi-algebraic set
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach
- The \(K\)-moment problem for continuous linear functionals
- A bounded degree SOS hierarchy for polynomial optimization
- Atomic optimization. I: Search space transformation and one-dimensional problems
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design
- Computing the distance between the linear matrix pencil and the completely positive cone
- Min-max and robust polynomial optimization
- Semidefinite programming for min-max problems and games
- A semidefinite algorithm for completely positive tensor decomposition
- On the complexity of computing the handicap of a sufficient matrix
- A polynomial optimization approach to constant rebalanced portfolio selection
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
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)
