Computation with Polynomial Equations and Inequalities arising in Combinatorial Optimization
Optimization and Control
2011-12-08 v1 Commutative Algebra
Abstract
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear algebra or semidefinite programming relaxations of many kinds of feasibility or optimization questions. We are particularly interested in problems arising in combinatorial optimization.
Cite
@article{arxiv.0909.0808,
title = {Computation with Polynomial Equations and Inequalities arising in Combinatorial Optimization},
author = {Jesus A. De Loera and Peter N. Malkin and Pablo A. Parrilo},
journal= {arXiv preprint arXiv:0909.0808},
year = {2011}
}
Comments
28 pages, survey paper