Cutting Planes for Convex Objective Nonconvex Optimization

This thesis studies methods for tightening relaxations of optimization problems with convex objective values over a nonconvex domain. A class of linear inequalities obtained by lifting easily obtained valid inequalities is introduced, and it is shown that this class of inequalities is sufficient to describe the epigraph of a convex and differentiable function over a general domain. In the special case where the objective is a positive definite quadratic function, polynomial time separation procedures using the new class of lifted inequalities are developed for the cases when the domain is the complement of the interior of a polyhedron, a union of polyhedra, or the complement of the interior of an ellipsoid. Extensions for positive semidefinite and indefinite quadratic objectives are also studied. Applications and computational considerations are discussed, and the results from a series of numerical experiments are presented.

Author dc:creator

• Michalka, Alexander

• Industrial engineering

Language dc:language

English

DOI dc:identifier

https://doi.org/10.7916/D8TF04RG

OAI identifier oai:identifier

oai:academiccommons.columbia.edu:10.7916/D8TF04RG