Generating Convex Polynomial Inequalities for Mixed 0–1 Programs

Authors:
Robert A. Stubbs;Sanjay Mehrotra
Affiliations:
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208-3119, USA (e-mail: rstubbs@dashopt.com);Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208-3119, USA (e-mail: mehrotra@iems.nwu.edu)
Venue:
Journal of Global Optimization
Year:
2002

Citing 9
Cited 2

A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems

Discrete Applied Mathematics
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Semidefinite programming

SIAM Review
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Approximate graph coloring by semidefinite programming

Journal of the ACM (JACM)
Semidefinite Programming Relaxation for NonconvexQuadratic Programs

Journal of Global Optimization

Performance-constrained template-driven retargeting for analog and RF layouts

Proceedings of the 20th symposium on Great lakes symposium on VLSI
Directly performance-constrained template-based layout retargeting and optimization for analog integrated circuits

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a method for generating valid convex quadratic inequalities for mixed0–1 convex programs. We also show how these inequalities can be generated in the linear case by defining cut generation problems using a projection cone. The basic results for quadratic inequalities are extended to generate convex polynomial inequalities.