scientific article
From MaRDI portal
Publication:3601990
zbMath1163.13021MaRDI QIDQ3601990
Publication date: 12 February 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semidefinite programming (90C22) Nonlinear programming (90C30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Semialgebraic sets and related spaces (14P10) Basic linear algebra (15A99) Ordered rings (13J25)
Related Items (only showing first 100 items - show all)
Minimizing the sum of many rational functions ⋮ Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors ⋮ Amoebas, nonnegative polynomials and sums of squares supported on circuits ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure ⋮ Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Some applications of polynomial optimization in operations research and real-time decision making ⋮ Polynomial-exponential decomposition from moments ⋮ On the construction of general cubature formula by flat extensions ⋮ Concepts and techniques of optimization on the sphere ⋮ Stability and genericity for semi-algebraic compact programs ⋮ A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding ⋮ Nonnegative Morse polynomial functions and polynomial optimization ⋮ Computing the distance between the linear matrix pencil and the completely positive cone ⋮ Symmetry in Turán sums of squares polynomials from flag algebras ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets ⋮ Global completability with applications to self-consistent quantum tomography ⋮ A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem ⋮ Real ideal and the duality of semidefinite programming for polynomial optimization ⋮ Tensor eigenvalue complementarity problems ⋮ Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity ⋮ Symmetric tensor decomposition ⋮ Partitioning procedure for polynomial optimization ⋮ Moment approximations for set-semidefinite polynomials ⋮ How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization ⋮ Completely positive reformulations of polynomial optimization problems with linear constraints ⋮ A semidefinite approach for truncated \(K\)-moment problems ⋮ A facial reduction algorithm for finding sparse SOS representations ⋮ Scaling relationship between the copositive cone and Parrilo's first level approximation ⋮ The subnormal completion problem in several variables ⋮ Optimality conditions and finite convergence of Lasserre's hierarchy ⋮ Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization ⋮ Rank of Handelman hierarchy for Max-Cut ⋮ Interiors of completely positive cones ⋮ Exact SDP relaxations for classes of nonlinear semidefinite programming problems ⋮ Real root finding for determinants of linear matrices ⋮ Computation of correlated equilibrium with global-optimal expected social welfare ⋮ The tracial moment problem and trace-optimization of polynomials ⋮ Extended formulation for CSP that is compact for instances of bounded treewidth ⋮ Symmetric sums of squares over \(k\)-subset hypercubes ⋮ Many 2-level polytopes from matroids ⋮ Closures of quadratic modules ⋮ Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions ⋮ The convex Positivstellensatz in a free algebra ⋮ Semidefinite representation of convex hulls of rational varieties ⋮ The multidimensional truncated moment problem: Carathéodory numbers ⋮ The multidimensional truncated moment problem: atoms, determinacy, and core variety ⋮ Linear control of time-domain constrained systems ⋮ Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems ⋮ On the complexity of computing the handicap of a sufficient matrix ⋮ The truncated moment problem via homogenization and flat extensions ⋮ Robust control of uncertain systems: classical results and recent developments ⋮ Dual semidefinite programs without duality gaps for a class of convex minimax programs ⋮ A Frank-Wolfe type theorem for nondegenerate polynomial programs ⋮ Design of Marx generators as a structured eigenvalue assignment ⋮ Positive semidefinite diagonal minus tail forms are sums of squares ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Separating inequalities for nonnegative polynomials that are not sums of squares ⋮ Handelman's hierarchy for the maximum stable set problem ⋮ On polynomial optimization over non-compact semi-algebraic sets ⋮ The cubic complex moment problem ⋮ The \(\mathcal A\)-truncated \(K\)-moment problem ⋮ A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals ⋮ Further results on Cauchy tensors and Hankel tensors ⋮ Numerical algebraic geometry and semidefinite programming ⋮ A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials ⋮ Solving fractional multicriteria optimization problems with sum of squares convex polynomial data ⋮ Positive definiteness of paired symmetric tensors and elasticity tensors ⋮ The core variety of a multisequence in the truncated moment problem ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ A note on nondegenerate matrix polynomials ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ The singular bivariate quartic tracial moment problem ⋮ Real eigenvalues of nonsymmetric tensors ⋮ Tensor maximal correlation problems ⋮ The tracial moment problem on quadratic varieties ⋮ Compactness criteria for real algebraic sets and Newton polyhedra ⋮ An improved semidefinite programming hierarchy for testing entanglement ⋮ Approximating the Pareto set of multiobjective linear programs via robust optimization ⋮ An SDP method for copositivity of partially symmetric tensors ⋮ On the exactness of Lasserre relaxations and pure states over real closed fields ⋮ An introduction to matrix convex sets and free spectrahedra ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Positive univariate trace polynomials ⋮ A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming ⋮ Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems ⋮ Approximation algorithms for nonnegative polynomial optimization problems over unit spheres ⋮ Extended formulations for vertex cover ⋮ Complex orthogonal polynomials and numerical quadrature via hyponormality ⋮ Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ A generalized flat extension theorem for moment matrices ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ Positivity of Riesz functionals and solutions of quadratic and quartic moment problems ⋮ Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares ⋮ A dynamic inequality generation scheme for polynomial programming
Uses Software
This page was built for publication:
