Skip to main content
Log in

Convex programming for disjunctive convex optimization

  • Published:
Mathematical Programming Submit manuscript

Abstract.

Given a finite number of closed convex sets whose algebraic representation is known, we study the problem of finding the minimum of a convex function on the closure of the convex hull of the union of those sets. We derive an algebraic characterization of the feasible region in a higher-dimensional space and propose a solution procedure akin to the interior-point approach for convex programming.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 27, 1996 / Revised version received June 11, 1999¶Published online November 9, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ceria, S., Soares, J. Convex programming for disjunctive convex optimization. Math. Program. 86, 595–614 (1999). https://doi.org/10.1007/s101070050106

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050106

Navigation