An interior point method for linear programming

[1]  Nikhil R. Devanur,et al.  A Rational Convex Program for Linear Arrow-Debreu Markets , 2013, ACM Trans. Economics and Comput..

[2]  Kurt Mehlhorn,et al.  Physarum can compute shortest paths , 2011, SODA.

[3]  Prateek Jain,et al.  Non-convex Optimization for Machine Learning , 2017, Found. Trends Mach. Learn..

[4]  Vijay V. Vazirani,et al.  The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game , 2012, JACM.

[5]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[6]  Nisheeth K. Vishnoi,et al.  Iteratively reweighted least squares and slime mold dynamics: connection and convergence , 2021, Math. Program..

[7]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[8]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[9]  Thomas Rothvoß,et al.  The matching polytope has exponential extension complexity , 2013, STOC.

[10]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[11]  J. Farkas.  Theorie der einfachen Ungleichungen. , 1902 .

[12]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[13]  Nisheeth K. Vishnoi,et al.  Lx = b , 2013, Found. Trends Theor. Comput. Sci..

[14]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[15]  Nisheeth K. Vishnoi,et al.  On the computability of continuous maximum entropy distributions with applications , 2020, STOC.

[16]  Shai Shalev-Shwartz,et al.  Online Learning and Online Convex Optimization , 2012, Found. Trends Mach. Learn..

[17]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[18]  Nisheeth K. Vishnoi,et al.  Real stable polynomials and matroids: optimization and counting , 2016, STOC.

[19]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

[20]  Heiko Röglin.  Smoothed Analysis , 2016, Encyclopedia of Algorithms.

[21]  Elad Hazan,et al.  Introduction to Online Convex Optimization , 2016, Found. Trends Optim..

[22]  Michael J. Todd,et al.  Polynomial Algorithms for Linear Programming , 1988 .

[23]  Alexander Schrijver,et al.  On the history of the transportation and maximum flow problems , 2002, Math. Program..

[24]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[25]  Boaz Barak,et al.  The uniform hardcore lemma via approximate Bregman projections , 2009, SODA.

[26]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[27]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[28]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[29]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[30]  L. Perko.  Differential Equations and Dynamical Systems , 1991 .

[31]  Anna R. Karlin,et al.  A (Slightly) Improved Approximation Algorithm for Metric TSP , 2020, ArXiv.

[32]  Sébastien Bubeck,et al.  Convex Optimization: Algorithms and Complexity , 2014, Found. Trends Mach. Learn..

[33]  Nisheeth K. Vishnoi,et al.  On a Natural Dynamics for Linear Programming , 2015, ITCS.

[34]  Nima Anari,et al.  A generalization of permanent inequalities and applications in counting and optimization , 2017, STOC.

[35]  Richard M. Karp,et al.  On linear characterizations of combinatorial optimization problems , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[36]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[37]  Umesh Vazirani,et al.  Algorithms, games, and evolution , 2014, Proceedings of the National Academy of Sciences.

[38]  Yin Tat Lee,et al.  An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.

[39]  G. Strang.  The Fundamental Theorem of Linear Algebra , 1993 .

[40]  Boris Polyak.  Some methods of speeding up the convergence of iteration methods , 1964 .

[41]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

[42]  Nisheeth K. Vishnoi,et al.  Natural Algorithms for Flow Problems , 2016, SODA.

[43]  E. Eisenberg,et al.  CONSENSUS OF SUBJECTIVE PROBABILITIES: THE PARI-MUTUEL METHOD, , 1959 .

[44]  James Renegar,et al.  A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.

[45]  Shang-Hua Teng,et al.  Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.

[46]  Mohit Singh,et al.  Entropy, optimization and counting , 2013, STOC.

[47]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[48]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[49]  T. Nakagaki,et al.  Intelligence: Maze-solving by an amoeboid organism , 2000, Nature.

[50]  Philipp Birken,et al.  Numerical Linear Algebra , 2011, Encyclopedia of Parallel Computing.

[51]  Nisheeth K. Vishnoi,et al.  On partitioning graphs via single commodity flows , 2008, STOC.

[52]  Nisheeth K. Vishnoi,et al.  Faster Algorithms via Approximation Theory , 2014, Found. Trends Theor. Comput. Sci..

[53]  Daniel A. Spielman,et al.  Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.

[54]  Sanjeev Arora,et al.  A combinatorial, primal-dual approach to semidefinite programs , 2007, STOC '07.

[55]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[56]  Y. Nesterov.  A method for unconstrained convex minimization problem with the rate of convergence o(1/k^2) , 1983 .