On the public citation graph

Minimizing Convex Functions with Rational Minimizers

https://doi.org/10.1145/3566050
0 signed · 43 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jctb.2000.1989openalex-snapshot
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
inferredcites →https://doi.org/10.1007/3-540-36478-1_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01071394openalex-snapshot
Cut-off method with space extension in convex programming problems
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02574061openalex-snapshot
Isoperimetric problems for convex bodies and a localization lemma
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf03025291openalex-snapshot
Mathematical problems for the next century
inferredcites →https://doi.org/10.1007/s10107-007-0189-2openalex-snapshot
A faster strongly polynomial time algorithm for submodular function minimization
inferredcites →https://doi.org/10.1007/s10107-011-0445-3openalex-snapshot
A strongly polynomial algorithm for linear systems having a binary solution
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50016-7openalex-snapshot
Geometric Methods in Combinatorial Optimization
inferredcites →https://doi.org/10.1016/s0095-8956(02)00047-3openalex-snapshot
A note on Schrijver's submodular function minimization algorithm
inferredcites →https://doi.org/10.1016/s0166-218x(02)00458-4openalex-snapshot
A push-relabel framework for submodular function minimization and applications to parametric optimization
inferredcites →https://doi.org/10.1016/s0898-1221(98)91141-5openalex-snapshot
Theory of linear and integer programming
inferredcites →https://doi.org/10.1016/s0927-0507(05)12007-6openalex-snapshot
Submodular Function Minimization
inferredcites →https://doi.org/10.1090/s0894-0347-09-00650-xopenalex-snapshot
Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
inferredcites →https://doi.org/10.1109/focs.2015.68openalex-snapshot
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
inferredcites →https://doi.org/10.1109/sfcs.1989.63500openalex-snapshot
A new algorithm for minimizing convex functions over convex sets
inferredcites →https://doi.org/10.1137/0212022openalex-snapshot
Towards a Genuinely Polynomial Algorithm for Linear Programming
inferredcites →https://doi.org/10.1137/1.9781611973068.133openalex-snapshot
A Simple Combinatorial Algorithm for Submodular Function Minimization
inferredcites →https://doi.org/10.1137/100811970openalex-snapshot
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
inferredcites →https://doi.org/10.1137/s0097539701397813openalex-snapshot
A Faster Scaling Algorithm for Minimizing Submodular Functions
inferredcites →https://doi.org/10.1137/s0097539791256325openalex-snapshot
Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
inferredcites →https://doi.org/10.1145/1008731.1008733openalex-snapshot
Solving convex programs by random walks
inferredcites →https://doi.org/10.1145/2746539.2746606openalex-snapshot
Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
inferredcites →https://doi.org/10.1145/321281.321291openalex-snapshot
Location of the Maximum on Unimodal Surfaces
inferredcites →https://doi.org/10.1145/3357713.3384326openalex-snapshot
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
inferredcites →https://doi.org/10.1145/3383454openalex-snapshot
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
inferredcites →https://doi.org/10.1145/3406325.3451018openalex-snapshot
Reducing isotropy and volume to KLS: an o *( n 3 ψ 2 ) volume algorithm
inferredcites →https://doi.org/10.1145/380752.380857openalex-snapshot
A sieve algorithm for the shortest lattice vector problem
inferredcites →https://doi.org/10.1145/502090.502096openalex-snapshot
A combinatorial strongly polynomial algorithm for minimizing submodular functions
inferredcites →https://doi.org/10.1214/12-aop760openalex-snapshot
Covariance estimation for distributions with ${2+\varepsilon}$ moments
inferredcites →https://doi.org/10.1287/moor.2016.0800openalex-snapshot
A Strongly Polynomial Algorithm for Generalized Flow Maximization
inferredcites →https://doi.org/10.1287/moor.2019.1011openalex-snapshot
Rescaling Algorithms for Linear Conic Feasibility
inferredcites →https://doi.org/10.1287/opre.39.6.955openalex-snapshot
A Strongly Polynomial Algorithm for a Special Class of Linear Programs
inferredcites →https://doi.org/10.5555/1234700.1234701openalex-snapshot
The geometry of logconcave functions and sampling algorithms
inferredcites →https://doi.org/10.5555/2780615.2780622openalex-snapshot
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
inferredcites →https://doi.org/10.5555/2794613.3114274openalex-snapshot
Submodular function minimization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4677303openalex-extracted
Distributionally robust optimization through the lens of submodularity
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00126openalex-snapshot
Sparse Submodular Function Minimization
inferred← citeshttps://doi.org/10.1137/1.9781611976465.59openalex-snapshot
Quantum algorithms for graph problems with cut queries
inferred← citeshttps://doi.org/10.2139/ssrn.3742569openalex-snapshot
Stochastic Localization Methods for Discrete Convex Simulation Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.