Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
From MaRDI portal
Publication:715233
DOI10.1007/S10107-012-0545-8zbMATH Open1262.90128OpenAlexW1966741919WikidataQ57568123 ScholiaQ57568123MaRDI QIDQ715233FDOQ715233
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
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
- Introductory lectures on convex optimization. A basic course.
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- A branch-and-cut method for 0-1 mixed convex programming
- Generalized Benders decomposition
- The Cutting-Plane Method for Solving Convex Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A polynomial oracle-time algorithm for convex integer minimization
- \(N\)-fold integer programming
- Complexity of integer quasiconvex polynomial optimization
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections
- Approximate nonlinear optimization over weighted independence systems
- Nonlinear Matroid Optimization and Experimental Design
- Integer optimization on convex semialgebraic sets
Cited In (5)
- Electrical flows over spanning trees
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- When is rounding allowed in integer nonlinear optimization?
- Isotonicity of minimizers in polychotomous discrete interval search via lattice programming
- A method for convex black-box integer global optimization
Uses Software
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)
