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
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, 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, 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, Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming, 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, Convergence of Lasserre's hierarchy: the general case, Minimizing the sum of many rational functions, Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors, Signomial and polynomial optimization via relative entropy and partial dualization, Local saddle points for unconstrained polynomial optimization, A discussion of probability functions and constraints from a variational perspective, 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, Moments and sums of squares for polynomial optimization and related problems, A globally convergent method for solving a quartic generalized Markowitz portfolio problem, Completely positive tensor recovery with minimal nuclear value, Sparse noncommutative polynomial optimization, Semidefinite programming and sums of Hermitian squares of noncommutative polynomials, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, Linearisation techniques and the dual algorithm for a class of mixed singular/continuous control problems in reinsurance. I: Theoretical aspects, The saddle point problem of polynomials, Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach, A tighter relaxation for the relative pose problem between cameras, Tensor eigenvalue complementarity problems, Graph recovery from incomplete moment information, Global optimality conditions and optimization methods for constrained polynomial programming problems, Time minimal saturation of a pair of spins and application in magnetic resonance imaging, A moment approach for entropy solutions to nonlinear hyperbolic PDEs, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, Borel measures with a density on a compact semi-algebraic set, A ``joint + marginal heuristic for 0/1 programs, A semidefinite approach for truncated \(K\)-moment problems, UTA-poly and UTA-splines: additive value functions with polynomial marginals, One-shot set-membership identification of generalized Hammerstein-Wiener systems, Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems, Partially positive matrices, Optimality conditions and finite convergence of Lasserre's hierarchy, Copositivity and constrained fractional quadratic problems, An algorithm for semi-infinite polynomial optimization, An efficient DC programming approach for portfolio decision with higher moments, Interiors of completely positive cones, Modal occupation measures and LMI relaxations for nonlinear switched systems control, An exact Jacobian SDP relaxation for polynomial optimization, The tracial moment problem and trace-optimization of polynomials, Hermitian completely positive matrices, Completely positive tensors in the complex field, Algorithms for the orthographic-\(n\)-point problem, Convex underestimators of polynomials, (Sub-)differentiability of probability functions with elliptical distributions, On the complexity of computing the handicap of a sufficient matrix, On the synthesis of linear \(H_\infty\) filters for polynomial systems, Robust control of uncertain systems: classical results and recent developments, Min-max and robust polynomial optimization, Distributionally robust polynomial chance-constraints under mixture ambiguity sets, Discriminants and nonnegative polynomials, Design of Marx generators as a structured eigenvalue assignment, Semidefinite programming for min-max problems and games, Approximate optimal designs for multivariate polynomial regression, Globally maximizing the sum of squares of quadratic forms over the unit sphere, The \(\mathcal A\)-truncated \(K\)-moment problem, On solving a class of fractional semi-infinite polynomial programming problems, Degeneracy of the intersection of three quadrics, Three dimensional strongly symmetric circulant tensors, A generalization of Löwner-John's ellipsoid theorem, A robust unscented transformation for uncertain moments, Modeling probability densities with sums of exponentials via polynomial approximation, Global optimality conditions and optimization methods for polynomial programming problems, Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms, A semidefinite algorithm for completely positive tensor decomposition, Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra, Real eigenvalues of nonsymmetric tensors, Tensor maximal correlation problems, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, Conic programming: infeasibility certificates and projective geometry, A polynomial optimization approach to constant rebalanced portfolio selection, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, 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, A hierarchy of semidefinite relaxations for completely positive tensor optimization problems, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, Approximating Pareto curves using semidefinite relaxations, The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials, Tensor \(Z\)-eigenvalue complementarity problems, A MAX-CUT formulation of 0/1 programs, Lower bounds for cubic optimization over the sphere, Multi-objective convex polynomial optimization and semidefinite programming relaxations, Plane-based resection for metric affine cameras, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Mean squared error minimization for inverse moment problems, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, A semidefinite programming approach for solving multiobjective linear programming, Monotonically positive matrices, Linear optimization with cones of moments and nonnegative polynomials, A new updating method for the damped mass-spring systems, A semidefinite relaxation method for second-order cone polynomial complementarity problems, SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection, Higher-degree tensor eigenvalue complementarity problems, Saddle points of rational functions, Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting, Distributionally robust optimization with moment ambiguity sets, An SDP relaxation method for Perron pairs of a nonnegative tensor
Uses Software
