Fetching the paper…
Reading the bibliography…
We improve upon the running time for finding a point in a convex set given a separation oracle.
Adjustment of an inverse matrix corresponding to a change in one element of a given matrix
Jack Sherman and Winifred J Morrison · 1950
Earlier work this paper cites.
On general minimax theorems
Maurice Sion · 1958
Earlier work this paper cites.
On an algorithm for the minimization of convex functions
A. Yu Levin · 1965
Earlier work this paper cites.
Matroid partition
Jack Edmonds · 1968
Earlier work this paper cites.
An algorithm for the solution of the max-flow problem with the polynomial estimation
EA Dinic · 1970
Earlier work this paper cites.
Submodular functions, matroids, and certain polyhedra
Jack Edmonds · 1970
Earlier work this paper cites.
Matching theory for combinatorial geometries
Martin Aigner and Thomas A Dowling · 1971
Earlier work this paper cites.
Algorithm for determining rank of a triple matrix product axb with application to problem of discerning existence of unique solution in a network
Nobuaki Tomizawa and Masao Iri · 1974
Earlier work this paper cites.
Matroid intersection algorithms
Eugene L Lawler · 1975
Earlier work this paper cites.
Evaluation of the information complexity of mathematical programming problems
David B Yudin and Arkadii S Nemirovski · 1976
Earlier work this paper cites.
A min-max relation for submodular functions on graphs
Jack Edmonds and Rick Giles · 1977
Earlier work this paper cites.
Cut-off method with space extension in convex programming problems
Naum Z Shor · 1977
Earlier work this paper cites.
Algorithms for solving the independent-flow problems
S. Fujishige · 1978
Earlier work this paper cites.
Matroid intersection
Jack Edmonds · 1979
Earlier work this paper cites.
Polynomial algorithms in linear programming
Leonid G Khachiyan · 1980
Earlier work this paper cites.
A weighted matroid intersection algorithm
András Frank · 1981
Earlier work this paper cites.
The ellipsoid method and its consequences in combinatorial optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 1981
Earlier work this paper cites.
On linear characterizations of combinatorial optimization problems
Richard M Karp and Christos H Papadimitriou · 1982
Earlier work this paper cites.
Minimization on submodular flows
U Zimmermann · 1982
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
D. B. Nemirovsky, A. S., & Yudin · 1983
Earlier work this paper cites.
On a” primal” matroid intersection algorithm
James B Orlin, John VandeVate, et al · 1983
Earlier work this paper cites.
A submodular network simplex method
Francisco Barahona and William H Cunningham · 1984
Earlier work this paper cites.
On submodular function minimization
William H Cunningham · 1985
Earlier work this paper cites.
A primal-dual algorithm for submodular flows
William H Cunningham and András Frank · 1985
Earlier work this paper cites.
A strongly polynomial minimum cost circulation algorithm
Éva Tardos · 1985
Earlier work this paper cites.
Two algorithms for weighted matroid intersection
Carl Brezovec, Gerard Cornuéjols, and Fred Glover · 1986
Earlier work this paper cites.
Improved bounds for matroid partition and intersection algorithms
William H Cunningham · 1986
Earlier work this paper cites.
An application of simultaneous diophantine approximation in combinatorial optimization
András Frank and Éva Tardos · 1987
Earlier work this paper cites.
An out-of-kilter method for submodular flows
Satoru Fujishige · 1987
Earlier work this paper cites.
A new approach to the maximum-flow problem
Andrew V Goldberg and Robert E Tarjan · 1988
Earlier work this paper cites.
Geometric algorithms and combinatorial optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 1988
Earlier work this paper cites.
The method of inscribed ellipsoids
LG Khachiyan, SP Tarasov, and II Erlikh · 1988
Earlier work this paper cites.
A primal algorithm for the submodular flow problem with minimum mean cycle selection
S. Fujishige W. Cui · 1988
Earlier work this paper cites.
A strongly polynomial algorithm for minimum cost submodular flow problems
Satoru Fujishige, Hans Röck, and Uwe Zimmermann · 1989
Earlier work this paper cites.
Self-concordant functions and polynomial-time methods in convex programming
Yu Nesterov and Arkadi Nemirovskiy · 1989
Earlier work this paper cites.
A new algorithm for minimizing convex functions over convex sets (extended abstract)
Pravin M. Vaidya · 1989
Earlier work this paper cites.
Speeding-up linear programming using fast matrix multiplication
Pravin M Vaidya · 1989
Earlier work this paper cites.
Finding minimum-cost circulations by successive approximation
Andrew V Goldberg and Robert E Tarjan · 1990
Earlier work this paper cites.
A dual algorithm for submodular flow problems
Nam-Kee Chung and Dong-Wan Tcha · 1991
Cited alongside, same era.
Conic formulation of a convex programming problem and duality
Yu Nesterov and A Nemirovsky · 1992
Cited alongside, same era.
Negative circuits for flows and submodular flows
Uwe Zimmermann · 1992
Cited alongside, same era.
Canceling most helpful total submodular cuts for submodular flow
S Thomas and McCormick · 1993
Cited alongside, same era.
Efficient methods in convex programming
Arkadi Nemirovski · 1994
Cited alongside, same era.
A cutting plane algorithm for convex programming that uses analytic centers
David S Atkinson and Pravin M Vaidya · 1995
Cited alongside, same era.
A push-relabel framework for submodular function minimization and applications to parametric optimization
Lisa Fleischer and Satoru Iwata · 2003
Later among the works it cites.
A faster scaling algorithm for minimizing submodular functions
Satoru Iwata · 2003
Later among the works it cites.
Approximate strong separation with application in fractional graph coloring and preemptive scheduling
Klaus Jansen · 2003
Later among the works it cites.
First-and second-order methods for semidefinite programming
Renato DC Monteiro · 2003
Later among the works it cites.
Exploiting sparsity in semidefinite programming via matrix completion ii: Implementation and numerical results
Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, and Kazuo Murota · 2003
Later among the works it cites.
Combinatorial optimization: polyhedra and efficiency
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An efficient cost scaling algorithm for the independent assignment problem
Satoru Fujishige and Zhang Xiaodong · 1995
Cited alongside, same era.
Complexity estimates of some cutting plane methods based on the analytic barrier
Yu Nesterov · 1995
Cited alongside, same era.
A long step cutting plane algorithm that uses the volumetric barrier
Srinivasan Ramaswamy and John E Mitchell · 1995
Cited alongside, same era.
A dual approximation approach to weighted matroid intersection
Maiko Shigeno and Satoru Iwata · 1995
Cited alongside, same era.
Large step volumetric potential reduction algorithms for linear programming
Kurt M Anstreicher · 1996
Cited alongside, same era.
Complexity analysis of an interior cutting plane method for convex feasibility problems
Jean-Louis Goffin, Zhi-Quan Luo, and Yinyu Ye · 1996
Cited alongside, same era.
Alexander Schrijver · 2003
Later among the works it cites.
A note on schrijver’s submodular function minimization algorithm
Jens Vygen · 2003
Later among the works it cites.
Solving convex programs by random walks
Dimitris Bertsimas and Santosh Vempala · 2004
Later among the works it cites.
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2005
Later among the works it cites.
Interior point and semidefinite approaches in combinatorial optimization
Kartik Krishnan and Tamás Terlaky · 2005
Later among the works it cites.
A unifying framework for several cutting plane methods for semidefinite programming
Kartik Krishnan and John E Mitchell · 2006
Later among the works it cites.
Simulated annealing in convex bodies and an o * {}^{\mbox{*}}
László Lovász and Santosh Vempala · 2006
Later among the works it cites.
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora and Satyen Kale · 2007
Later among the works it cites.
Fast matrix multiplication is stable
James Demmel, Ioana Dumitriu, Olga Holtz, and Robert Kleinberg · 2007
Later among the works it cites.
Submodular function minimization
Satoru Iwata · 2008
Later among the works it cites.
A simple combinatorial algorithm for submodular function minimization
Satoru Iwata and James B Orlin · 2009
Later among the works it cites.
A faster strongly polynomial time algorithm for submodular function minimization
James B Orlin · 2009
Later among the works it cites.
A parallel approximation algorithm for positive semidefinite programming
Rahul Jain and Penghui Yao · 2011
Later among the works it cites.
Randomized algorithms for matrices and data
Michael W. Mahoney · 2011
Later among the works it cites.
Graph sparsification by effective resistances
Daniel A Spielman and Nikhil Srivastava · 2011
Later among the works it cites.
Optimal multi-dimensional mechanism design: Reducing revenue to welfare maximization
Yang Cai, Constantinos Daskalakis, and S Matthew Weinberg · 2012
Later among the works it cites.
Random walks on polytopes and an affine interior point method for linear programming
Ravindran Kannan and Hariharan Narayanan · 2012
Later among the works it cites.
Properties of a cutting plane method for semidefinite programming
Kartik Krishnan and John E Mitchell · 2012
Later among the works it cites.
Iterative row sampling
Mu Li, Gary L Miller, and Richard Peng · 2012
Later among the works it cites.
Multiplying matrices faster than coppersmith-winograd
Virginia Vassilevska Williams · 2012
Later among the works it cites.
Learning with submodular functions: A convex optimization perspective
Francis Bach · 2013
Later among the works it cites.
Reducing revenue to welfare maximization: Approximation algorithms and other generalizations
Yang Cai, Constantinos Daskalakis, and S Matthew Weinberg · 2013
Later among the works it cites.
A new approach to computing maximum flows using electrical flows
Yin Tat Lee, Satish Rao, and Nikhil Srivastava · 2013
Later among the works it cites.
Path finding ii: An \ \backslash ˜ o (m sqrt (n)) algorithm for the minimum cost flow problem
Yin Tat Lee and Aaron Sidford · 2013
Later among the works it cites.
Submodular Function Minimization
S McCormick · 2013
Later among the works it cites.
Uniform sampling for matrix approximation
Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2014
Later among the works it cites.
Powers of tensors and fast matrix multiplication
François Le Gall · 2014
Later among the works it cites.
Path-finding methods for linear programming : Solving linear programs in õ(sqrt(rank)) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Later among the works it cites.
Using optimization to obtain a width-independent, parallel, simpler, and faster positive sdp solver
Zeyuan Allen-Zhu, Yin Tat Lee, and Lorenzo Orecchia · 2015
Closest in time.
A geometric alternative to nesterov’s accelerated gradient descent
Sébastien Bubeck, Yin Tat Lee, and Mohit Singh · 2015
Closest in time.
Bayesian truthful mechanisms for job scheduling from bi-criterion approximation algorithms
Constantinos Daskalakis and S Matthew Weinberg · 2015
Closest in time.
Efficient inverse maintenance and faster algorithms for linear programming
Yin Tat Lee and Aaron Sidford · 2015
Closest in time.