Exploiting Equalities in Polynomial Programming
Vera Juan (jveraandrew.cmu.edu)
Abstract: We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (typically simpler) problem without equalities can be used to address the problem with equalities. In particular, we propose new solution schemes for mixed binary programs, pure 0-1 quadratic programs, and the stable set problem.
Keywords: Polynomial programming, 0-1 programming, stable set problem, LMI approximations
Category 1: Nonlinear Optimization
Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )
Category 3: Linear, Cone and Semidefinite Programming
Citation: Operations Research Letters 36 (2008) pp. 223--228.
Entry Submitted: 05/11/2006
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|