Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes

DOI10.1007/s10107-012-0545-8zbMath1262.90128OpenAlexW1966741919WikidataQ57568123 ScholiaQ57568123MaRDI QIDQ715233

Michael Martin Michel Baes, Alberto Del Pia, Robert Weismantel, Shmuel Onn, Yu. E. Nesterov

Publication date: 2 November 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/51190

zbMATH Keywords

intractabilitystrongly convex functionsnonlinear discrete optimization

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Related Items

When is rounding allowed in integer nonlinear optimization?, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Electrical flows over spanning trees

Uses Software

• Bonmin

Cites Work

• A polynomial oracle-time algorithm for convex integer minimization
• An algorithmic framework for convex mixed integer nonlinear programs
• \(N\)-fold integer programming
• Solving mixed integer nonlinear programs by outer approximation
• Introductory lectures on convex optimization. A basic course.
• A branch-and-cut method for 0-1 mixed convex programming
• Integer optimization on convex semialgebraic sets
• Complexity of integer quasiconvex polynomial optimization
• Generalized Benders decomposition
• Parametric nonlinear discrete optimization over well-described sets and matroid intersections
• Approximate Nonlinear Optimization over Weighted Independence Systems
• The Cutting-Plane Method for Solving Convex Programs
• Nonlinear Matroid Optimization and Experimental Design
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs