Integer convex minimization by mixed integer linear optimization
From MaRDI portal
Recommendations
Cites work
- Complexity of integer quasiconvex polynomial optimization
- Convex and Discrete Geometry
- Ellipsoids of maximal volume in convex bodies
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 1182913 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- Integer optimization on convex semialgebraic sets
- Integer Programming with a Fixed Number of Variables
- Introductory lectures on convex optimization. A basic course.
- Partitions of mass-distributions and of convex bodies by hyperplanes
- Solving convex programs by random walks
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Triangulations. Structures for algorithms and applications
Cited in
(31)- Convex integer maximization via Graver bases
- Optimization of a convex program with a polynomial perturbation
- The relationship between integer and real solutions of constrained convex programming
- Optimality certificates for convex minimization and Helly numbers
- A method for convex black-box integer global optimization
- Integer conic function minimization based on the comparison oracle
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension
- The (not so) trivial lifting in two dimensions
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- On the complexity of quasiconvex integer minimization problem
- Convex integer optimization by constantly many linear counterparts
- Integer programming in parameterized complexity: five miniatures
- On minimal valid inequalities for mixed integer conic programs
- Efficient convex optimization with oracles
- Minimizing a symmetric quasiconvex function on a two-dimensional lattice
- scientific article; zbMATH DE number 2159405 (Why is no real title available?)
- scientific article; zbMATH DE number 221051 (Why is no real title available?)
- Integer programming in parameterized complexity: three miniatures
- Minimization of even conic functions on the two-dimensional integral lattice
- Parameterized complexity of fair vertex evaluation problems
- On Proximity for k-Regular Mixed-Integer Linear Optimization
- Mirror-Descent Methods in Mixed-Integer Convex Optimization
- scientific article; zbMATH DE number 7064051 (Why is no real title available?)
- Centerpoints: a link between optimization and convex geometry
- A generalized simplex method for integer problems given by verification oracles
- On efficient algorithms for finding efficient salvo policies
- Information complexity of mixed-integer convex optimization
- Optimizing low dimensional functions over the integers
- Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube
- Complexity of optimizing over the integers
- Convex quadratic sets and the complexity of mixed integer convex quadratic programming
This page was built for publication: Integer convex minimization by mixed integer linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785273)
