Exploiting equalities in polynomial programming
type: Item
instance of: scholarly article
title: Exploiting equalities in polynomial programming
zbMATH Open document ID: 1163.90755
author: Javier Peña
author: Luis Fernando Zuluaga
author: Juan Vera
published in: Operations Research Letters
publication date: 2008-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 5306948
zbMATH Keywords: polynomial programming
zbMATH Keywords: 0-1 programming
zbMATH Keywords: stable set problem
zbMATH Keywords: LMI approximations
describes a project that uses: SeDuMi
describes a project that uses: SDPT3
describes a project that uses: SDPARA
MaRDI profile type: Publication
full work available at URL: j.orl.2007.05.011
OpenAlex ID: W2035949967
Wikidata QID: Q58051159
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: On the Relation Between Option and Stock Prices: A Convex Optimization Approach
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: Approximation of the stability number of a graph via copositive programming
cites work: Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
cites work: Representing polynomials by positive linear functions on compact convex polyhedra
cites work: An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
cites work: Bounds on measures satisfying moment conditions.
cites work: Semidefinite Programming vs. LP Relaxations for Polynomial Programming
cites work: Semidefinite representations for finite varieties
cites work: Large-scale semidefinite programming via a saddle point mirror-prox algorithm
cites work: Semidefinite programming relaxations for semialgebraic problems
cites work: Q4428719
cites work: Sums of squares on real algebraic surfaces
cites work: The \(K\)-moment problem for compact semi-algebraic sets
cites work: Class of global minimum bounds of polynomial functions
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: On Cones of Nonnegative Quadratic Functions
cites work: Minimizing polynomials via sum of squares over the gradient ideal
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: Q5641059
cites work: LMI Approximations for Cones of Positive Semidefinite Forms
DBLP publication ID: journals/orl/PenaVZ08
DOI: 10.1016/J.ORL.2007.05.011
description: scientific article; zbMATH DE number 5306948