Work

Optimality certificates for convex minimization and Helly numbers

Year: 2016

Type: preprint

Abstract: We consider the problem of minimizing a convex function over a subset of R^n that is not necessarily convex (minimization of a convex function over the integer points in a polytope is a special case). We define a family of duals for this problem and show that, under some natural conditions, strong duality holds for a dual problem in this family that is more restrictive than previously considered duals.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1610.08648

Authors: Basu, Amitabh, Conforti, Michele, Cornuéjols, Gérard, Weismantel, Robert, Weltge, Stefan

Institutions: Johns Hopkins University, University of Padua, Carnegie Mellon University, ETH Zurich

Language: English

Topic: Advanced Optimization Algorithms Research

Subfield: Numerical Analysis

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Eidgenössische Technische Hochschule Zürich, Office of Naval Research

Award: Mixed Integer Optimization: New Cut Generation Paradigms

OpenAlex ID: W2950891173

Cites: 10

Cited by:

Related to: 20