Exploiting equalities in polynomial programming

Authors:
Javier F. PeñA;Juan C. Vera;Luis F. Zuluaga
Affiliations:
Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15232, USA;Mellon College of Science, Carnegie Mellon University, USA;Faculty of Business Administration, University of New Brunswick, Canada
Venue:
Operations Research Letters
Year:
2008

Citing 13
Cited 1

A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
Approximation of the Stability Number of a Graph via Copositive Programming

SIAM Journal on Optimization
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs

SIAM Journal on Optimization
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming

Journal of Global Optimization
Semidefinite Programming vs. LP Relaxations for Polynomial Programming

Mathematics of Operations Research
On the Relation Between Option and Stock Prices: A Convex Optimization Approach

Operations Research
On cones of nonnegative quadratic functions

Mathematics of Operations Research
SDPARA: semiDefinite programming algorithm paRAllel version

Parallel Computing
LMI Approximations for Cones of Positive Semidefinite Forms

SIAM Journal on Optimization
Minimizing Polynomials via Sum of Squares over the Gradient Ideal

Mathematical Programming: Series A and B
Semidefinite representations for finite varieties

Mathematical Programming: Series A and B
Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm

Mathematical Programming: Series A and B
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

An iterative scheme for valid polynomial inequality generation in binary polynomial programming

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel approach for solving polynomial programs over compact domains with equality constraints. By means of a generic transformation, we show that existing solution schemes for the, typically simpler, problem without equalities can be used to address the problem with equalities.