GloptiPoly 3: moments, optimization and semidefinite programming
From MaRDI portal
Publication:3396396
DOI10.1080/10556780802699201zbMath1178.90277arXiv0709.2559OpenAlexW2090967418MaRDI QIDQ3396396
Johan Löfberg, Jean-Bernard Lasserre, Didier Henrion
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.2559
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Moment problems (44A60)
Related Items (only showing first 100 items - show all)
Algebraic Perspectives on Signomial Optimization ⋮ Separability of Hermitian tensors and PSD decompositions ⋮ Regularized robust optimization: the optimal portfolio execution case ⋮ Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ Finding largest small polygons with gloptipoly ⋮ Computing generalized Nash equilibria by polynomial programming ⋮ Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation ⋮ A bounded degree SOS hierarchy for polynomial optimization ⋮ Dual form reduction in the atomic optimization method ⋮ Computing Gaussian \& exponential measures of semi-algebraic sets ⋮ The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory ⋮ Converging outer approximations to global attractors using semidefinite programming ⋮ On turnpike and dissipativity properties of continuous-time optimal control problems ⋮ Moment and polynomial bounds for ruin-related quantities in risk theory ⋮ An irreducible function basis of isotropic invariants of a third order three-dimensional symmetric tensor ⋮ Greedy Approaches to Symmetric Orthogonal Tensor Decomposition ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ Algebraic optimization of sequential decision problems ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Bounding Stationary Averages of Polynomial Diffusions via Semidefinite Programming ⋮ Stokes, Gibbs, and volume computation of semi-algebraic sets ⋮ Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method ⋮ Ensemble approximations for constrained dynamical systems using Liouville equation ⋮ Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities ⋮ Dehomogenization for completely positive tensors ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets ⋮ Rational Generalized Nash Equilibrium Problems ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ A regularization-patching dual quaternion optimization method for solving the hand-eye calibration problem ⋮ Hausdorff distance between convex semialgebraic sets ⋮ A utopia point method-based robust vector polynomial optimization scheme ⋮ On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials ⋮ Generalized truncated moment problems with unbounded sets ⋮ Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem ⋮ Semi-definite relaxations for optimal control problems with oscillation and concentration effects ⋮ Quadratic tensor eigenvalue complementarity problems ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ On New Classes of Nonnegative Symmetric Tensors ⋮ Certifying convergence of Lasserre's hierarchy via flat truncation ⋮ Exploiting sparsity for semi-algebraic set volume computation ⋮ Loss functions for finite sets ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ Symmetric Tensor Nuclear Norms ⋮ A MODIFIED FR CONJUGATE GRADIENT METHOD FOR COMPUTING -EIGENPAIRS OF SYMMETRIC TENSORS ⋮ Atomic optimization. I: Search space transformation and one-dimensional problems ⋮ Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations ⋮ A semidefinite method for tensor complementarity problems ⋮ Computing the Hausdorff Boundary Measure of Semialgebraic Sets ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ Properties and methods for finding the best rank-one approximation to higher-order tensors ⋮ Computable Primal and Dual Bounds for Stochastic Control ⋮ A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis ⋮ Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxations ⋮ Nonstationary LPV control for trajectory tracking: a double pendulum example ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ Global optimization ⋮ Alternating direction method of multipliers for real and complex polynomial optimization models ⋮ Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design ⋮ Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization ⋮ The CP-Matrix Approximation Problem ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ A convex optimization model for finding non-negative polynomials ⋮ Introduction to Semidefinite, Conic and Polynomial Optimization ⋮ A “Joint+Marginal” Approach in Optimization ⋮ Positivity and Optimization: Beyond Polynomials ⋮ On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 ⋮ Moment-SoS methods for optimal transport problems ⋮ Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming ⋮ A Lagrange–Newton algorithm for tensor sparse principal component analysis ⋮ Stochastic polynomial optimization ⋮ Positive Maps and Separable Matrices ⋮ GpoSolver: a Matlab/C++ toolbox for global polynomial optimization ⋮ Bracketing backward reach sets of a dynamical system ⋮ NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials ⋮ Algorithm 950 ⋮ Immediate schedule adjustment and semidefinite relaxation ⋮ Test of copositive tensors ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices ⋮ Generation of signals with specified second-order properties for constrained systems ⋮ The $\mathbf {K}$-moment problem for continuous linear functionals ⋮ Inhomogeneous polynomial optimization over a convex set: An approximation approach ⋮ T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method ⋮ Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions ⋮ Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces ⋮ Nonlinear H ∞ output feedback control with integrator for polynomial discrete‐time systems ⋮ Geometric and numerical methods in the contrast imaging problem in nuclear magnetic resonance ⋮ Reflection groups, reflection arrangements, and invariant real varieties ⋮ The maximum tensor complementarity eigenvalues ⋮ Efficient upper and lower bounds for global mixed-integer optimal control ⋮ Formal Proofs for Nonlinear Optimization ⋮ A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition ⋮ Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm ⋮ Robust approximation of chance constrained optimization with polynomial perturbation
Uses Software
This page was built for publication: GloptiPoly 3: moments, optimization and semidefinite programming
