An Introduction to Polynomial and Semi-Algebraic Optimization
From MaRDI portal
Publication:2930845
DOI10.1017/CBO9781107447226zbMath1320.90003OpenAlexW404764422MaRDI QIDQ2930845
Publication date: 20 November 2014
Full work available at URL: https://doi.org/10.1017/cbo9781107447226
global optimizationlinear programminginteger programmingconvex optimizationnonlinear programmingpolynomial optimization
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
On duality gap with polynomial multipliers for polynomial optimization problems, Signomial and polynomial optimization via relative entropy and partial dualization, Separability of Hermitian tensors and PSD decompositions, kNN Classification with an Outlier Informative Distance Measure, Positivity certificates and polynomial optimization on non-compact semialgebraic sets, Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, Data loci in algebraic optimization, Counting isolated points outside the image of a polynomial map, The saddle point problem of polynomials, Graph recovery from incomplete moment information, Computing Gaussian \& exponential measures of semi-algebraic sets, Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint, Optimization on the Euclidean Unit Sphere, The multidimensional truncated moment problem: the moment cone, Error bounds for monomial convexification in polynomial optimization, The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments, Tangencies and polynomial optimization, On the effective Putinar's Positivstellensatz and moment approximation, Homogenization for polynomial optimization with unbounded sets, A faster interior-point method for sum-of-squares optimization, A hierarchy of spectral relaxations for polynomial optimization, Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization, Convergences for robust bilevel polynomial programmes with applications, Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method, Dehomogenization for completely positive tensors, Optimality Conditions for Minimizers at Infinity in Polynomial Programming, Rational Generalized Nash Equilibrium Problems, Multiple oracle algorithm to solve continuous games, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization, Sum-of-squares relaxations in robust DC optimization and feature selection, A utopia point method-based robust vector polynomial optimization scheme, Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization, On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials, Generalized truncated moment problems with unbounded sets, Quasi-quadratic modules in valuation rings and valued fields, A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems, Pell's equation, sum-of-squares and equilibrium measures on a compact set, Computation of Sum of Squares Polynomials from Data Points, Sum-of-squares chordal decomposition of polynomial matrix inequalities, New bounds for nonconvex quadratically constrained quadratic programming, On Optimal Cell Average Decomposition for High-Order Bound-Preserving Schemes of Hyperbolic Conservation Laws, Harmonic Hierarchies for Polynomial Optimization, Quadratic tensor eigenvalue complementarity problems, Convex generalized Nash equilibrium problems and polynomial optimization, Loss functions for finite sets, Symmetric Tensor Nuclear Norms, Sparse linear regression from perturbed data, Unnamed Item, Bounding extrema over global attractors using polynomial optimisation, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, The multidimensional truncated moment problem: Gaussian and log-normal mixtures, their Carathéodory numbers, and set of atoms, Sum-of-Squares Optimization without Semidefinite Programming, A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis, Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies, Hermitian Tensor Decompositions, A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials, Semidefinite program duals for separable polynomial programs involving box constraints, A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging, Unnamed Item, Minimum wave speeds in monostable reaction–diffusion equations: sharp bounds by polynomial optimization, The algebro-geometric study of range maps, Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers, LMI pole regions for a robust discrete-time pole placement controller design, An SDP method for copositivity of partially symmetric tensors, A new algorithm for concave quadratic programming, Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization, A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems, A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs, The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials, A MAX-CUT formulation of 0/1 programs, The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions, Multi-objective convex polynomial optimization and semidefinite programming relaxations, The Bottleneck Degree of Algebraic Varieties, Algorithm 998, Finding Extremal Periodic Orbits with Polynomial Optimization, with Application to a Nine-Mode Model of Shear Flow, A Matrix Positivstellensatz with Lifting Polynomials, Stochastic polynomial optimization, Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, The moment-SOS hierarchy and the Christoffel-Darboux kernel, Coloring the Voronoi tessellation of lattices, A semidefinite relaxation method for second-order cone polynomial complementarity problems, Higher-degree tensor eigenvalue complementarity problems, Saddle points of rational functions, Modeling and estimation of thermal flows based on transport and balance equations, Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization, A sublevel moment-SOS hierarchy for polynomial optimization, Finding unstable periodic orbits: a hybrid approach with polynomial optimization, Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP, A disintegration of the Christoffel function, T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, The maximum tensor complementarity eigenvalues, Optimal Transport to a Variety, On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate, Transformations of moment functionals, Control analysis and design via randomised coordinate polynomial minimisation
Uses Software
