Minimizing convex functions with rational minimizers

Cites work

scientific article; zbMATH DE number 3860890 (Why is no real title available?)
scientific article; zbMATH DE number 3508265 (Why is no real title available?)
scientific article; zbMATH DE number 4123531 (Why is no real title available?)
scientific article; zbMATH DE number 1234104 (Why is no real title available?)
scientific article; zbMATH DE number 7051294 (Why is no real title available?)
scientific article; zbMATH DE number 3333393 (Why is no real title available?)
scientific article; zbMATH DE number 3422402 (Why is no real title available?)
A Faster Scaling Algorithm for Minimizing Submodular Functions
A Strongly Polynomial Algorithm for a Special Class of Linear Programs
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
A \(O(1/\epsilon ^{2})^{n }\)-time sieving algorithm for approximate integer programming
A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
A faster strongly polynomial time algorithm for submodular function minimization
A hierarchy of polynomial time lattice basis reduction algorithms
A note on Schrijver's submodular function minimization algorithm.
A polynomial projection algorithm for linear feasibility problems
A primal-dual interior point method whose running time depends only on the constraint matrix
A push-relabel framework for submodular function minimization and applications to parametric optimization
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
A sieve algorithm for the shortest lattice vector problem
A simpler and faster strongly polynomial algorithm for generalized flow maximization
A strongly polynomial algorithm for generalized flow maximization
A strongly polynomial algorithm for linear systems having a binary solution
Algorithms for the densest sub-lattice problem
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Covariance estimation for distributions with \({2+\varepsilon}\) moments
Factoring polynomials with rational coefficients
Geometric algorithms and combinatorial optimization
Geometric rescaling algorithms for submodular function minimization
Geometry of numbers
Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
Isoperimetric problems for convex bodies and a localization lemma
Location of the Maximum on Unimodal Surfaces
Mathematical problems for the next century
Polynomial algorithms in linear programming
Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
Random walks and anO*(n5) volume algorithm for convex bodies
Reducing isotropy and volume to KLS: an o *( n ³ ψ ² ) volume algorithm
Rescaling algorithms for linear conic feasibility
Solving convex programs by random walks
Solving the shortest vector problem in \(2^n\) time using discrete Gaussian sampling (extended abstract)
Submodular function minimization
Submodular function minimization
The ellipsoid method and its consequences in combinatorial optimization
The geometry of logconcave functions and sampling algorithms
Towards a Genuinely Polynomial Algorithm for Linear Programming

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)