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

DOI10.1007/S10107-012-0545-8MaRDI QIDQ715233zbMATH OpenOpenAlexWikidataFDO

Authors Michael Martin Michel Baes, Alberto Del Pia, Shmuel Onn, Robert Weismantel, Yuri 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

intractabilitynonlinear discrete optimizationstrongly convex functions

Mathematics Subject Classification ID

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

Recommendations

• Convex minimization under Lipschitz constraints
• Minimization of convex functions on the convex hull of a point set
• Minimizing Piecewise-Concave Functions Over Polyhedra
• Lipschitz Behavior of Solutions to Convex Minimization Problems
• Publication:4349640
• Minimizing continuous extensions of discrete convex functions with linear inequality constraints
• scientific article; zbMATH DE number 5564095
• Publication:3468553
• scientific article; zbMATH DE number 4035595
• An algorithm and new penalties for concave integer minimization over a polyhedron

Cites work

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

Cited in

(5)

• Isotonicity of minimizers in polychotomous discrete interval search via lattice programming
• A method for convex black-box integer global optimization
• Electrical flows over spanning trees
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities
• When is rounding allowed in integer nonlinear optimization?

Describes a project that uses

Uses Software

• Bonmin

This page was built for publication: Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715233)