Minimizing convex functions with rational minimizers

Cites Work

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