Minimizing convex functions with rational minimizers

Cites Work

A hierarchy of polynomial time lattice basis reduction algorithms
A sieve algorithm for the shortest lattice vector problem
Geometric algorithms and combinatorial optimization
Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
Factoring polynomials with rational coefficients
The ellipsoid method and its consequences in combinatorial optimization
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Isoperimetric problems for convex bodies and a localization lemma
Polynomial algorithms in linear programming
Random walks and anO*(n5) volume algorithm for convex bodies
Solving convex programs by random walks
A polynomial projection algorithm for linear feasibility problems
Mathematical problems for the next century
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A faster strongly polynomial time algorithm for submodular function minimization
A push-relabel framework for submodular function minimization and applications to parametric optimization
A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
Covariance estimation for distributions with \({2+\varepsilon}\) moments
A primal-dual interior point method whose running time depends only on the constraint matrix
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
A Strongly Polynomial Algorithm for Generalized Flow Maximization
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
Title not available (Why is that?)
Geometry of numbers
The geometry of logconcave functions and sampling algorithms
Submodular function minimization
A strongly polynomial algorithm for linear systems having a binary solution
Submodular function minimization
Title not available (Why is that?)
Location of the Maximum on Unimodal Surfaces
Title not available (Why is that?)
Towards a Genuinely Polynomial Algorithm for Linear Programming
Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
A Faster Scaling Algorithm for Minimizing Submodular Functions
A Strongly Polynomial Algorithm for a Special Class of Linear Programs
A note on Schrijver's submodular function minimization algorithm.
Solving the Shortest Vector Problem in 2 ⁿ Time Using Discrete Gaussian Sampling
Title not available (Why is that?)
Algorithms for the Densest Sub-Lattice Problem
Geometric Rescaling Algorithms for Submodular Function Minimization
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
Rescaling Algorithms for Linear Conic Feasibility
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
Reducing isotropy and volume to KLS: an o *( n ³ ψ ² ) volume algorithm

This page was built for publication: Minimizing convex functions with rational minimizers

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