Allen Zhu, Zeyuan, and Orecchia, Lorenzo. 2017. Linear coupling: an ultimate unification of gradient and mirror descent. Pages 3:1–3:22 of: 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9–11, Berkeley, CA. LIPIcs, vol. 67.Google Scholar

Anari, Nima, and Oveis Gharan, Shayan. 2017. A generalization of permanent inequalities and applications in counting and optimization. Pages 384–396 of: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 June 19–23, Montreal, Quebec.Google Scholar

Apostol, Tom M. 1967a. Calculus: One-Variable Calculus, with an Introduction to Linear Algebra. Blaisdell Book in Pure and Applied Mathematics. London: Blaisdell.Google Scholar

Apostol, Tom M. 1967b. Calculus, Vol. 2: Multi-variable Calculus and Linear Algebra with Applications to Differential Equations and Probability. New York: Wiley.Google Scholar

Arora, Sanjeev, and Barak, Boaz. 2009. Computational Complexity: A Modern Approach. New York: Cambridge University Press.Google Scholar

Arora, Sanjeev, Hazan, Elad, and Kale, Satyen. 2005. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. Pages 339–348 of: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS’05, October 23–25, Pittsburgh, PA.CrossRefGoogle Scholar

Arora, Sanjeev, Hazan, Elad, and Kale, Satyen. 2012. The multiplicative weights update method: a meta-algorithm and applications. Theory of Computing, 8(6), 121–164.CrossRefGoogle Scholar

Arora, Sanjeev, and Kale, Satyen. 2016. A combinatorial, primal-dual approach to semidefinite programs. Journal of the Association for Computing Machinery, 63(2).Google Scholar

Barak, Boaz, Hardt, Moritz, and Kale, Satyen. 2009. The uniform hardcore lemma via approximate Bregman projections. Pages 1193–1200 of: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, January 4–6 New York, NY.Google Scholar

Barvinok, Alexander. 2002. A Course in Convexity. Providence, RI: American Mathematical Society.Google Scholar

Beck, Amir, and Teboulle, Marc. 2003. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3), 167–175.Google Scholar

Beck, Amir, and Teboulle, Marc. 2009. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1), 183–202.Google Scholar

Bonifaci, Vincenzo, Mehlhorn, Kurt, and Varma, Girish. 2012. Physarum can compute shortest paths. Pages 233–240 of: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, January 17–19, Kyoto, Japan.Google Scholar

Boyd, Stephen, and Vandenberghe, Lieven. 2004. Convex Optimization. Cambridge: Cambridge University Press.Google Scholar

Bubeck, Sébastien. 2015. Convex optimization: algorithms and complexity. Foundations and Trends in Machine Learning, 8(3–4), 231–357.Google Scholar

Bubeck, Sébastien, and Eldan, Ronen. 2015. The entropic barrier: a simple and optimal universal self-concordant barrier. Page 279 of: Proceedings of the 28th Conference on Learning Theory, COLT 2015, July 3–6,Paris,France.Google Scholar

Bürgisser, Peter, Franks, Cole, Garg, Ankit, de Oliveira, Rafael Mendes, Walter, Michael, and Wigderson, Avi. 2019. Towards a theory of non-commutative optimization: geodesic 1st and 2nd order methods for moment maps and polytopes. Pages 845–861 of: Zuckerman, David (ed.), 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, November 9–12, Baltimore, MD.CrossRefGoogle Scholar

Celis, L. Elisa, Keswani, Vijay, and Vishnoi, Nisheeth K. 2020. Data preprocessing to mitigate bias: a maximum entropy based approach. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, July 13–18, 2020, Virtual Event. Proceedings of Machine Learning Research 119. PMLR 2020.Google Scholar

Chastain, Erick, Livnat, Adi, Papadimitriou, Christos, and Vazirani, Umesh. 2014. Algorithms, games, and evolution. Proceedings of the National Academy of Sciences, 111(29), 10620–10623.Google Scholar

Christiano, Paul, Kelner, Jonathan A., Madry, Aleksander, Spielman, Daniel A., and Teng, Shang-Hua. 2011. Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs. Pages 273–282 of: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, June 6–8, San Jose, CA.Google Scholar

Cohen, Michael B., Madry, Aleksander, Tsipras, Dimitris, and Vladu, Adrian. 2017. Matrix scaling and balancing via box constrained newton’s method and interior point methods. Pages 902–913 of: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, October 15–17, Berkeley, CA.Google Scholar

Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., and Stein, Clifford. 2001. Introduction to Algorithms. Cambridge, MA: MIT Press.Google Scholar

Daitch, Samuel I., and Spielman, Daniel A. 2008. Faster approximate lossy generalized flow via interior point algorithms. Pages 451–460 of: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, May 17–20, Victoria, British Columbia.Google Scholar

Dantzig, George B. 1990. A history of scientific computing. Pages 141–151 of: Origins of the Simplex Method. New York: Association for Computing Machinery.Google Scholar

Dasgupta, Sanjoy, Papadimitriou, Christos H., and Vazirani, Umesh. 2006. Algorithms. New York, NY: McGraw-Hill.Google Scholar

Devanur, Nikhil R., Garg, Jugal, and Végh, Làszló A. 2016. A rational convex program for linear Arrow-Debreu markets. ACM Transactions on Economics and Computation, 5(1), 6:1–6:13.Google Scholar

Diestel, Reinhard. 2012. Graph Theory. 4th ed. Graduate Texts in Mathematics, Vol. 173. Berlin, Heidelberg: Springer-Verlag.Google Scholar

Dinic, E. A. 1970. Algorithm for solution of a problem of maximal flow in a network with power estimation. Soviet Math Dokl, 224(11), 1277–1280.Google Scholar

Dudik, Miroslav. 2007. Maximum Entropy Density Estimation and Modeling Geographic Distributions of Species. Ph.D. thesis, Princeton University.Google Scholar

Edmonds, Jack. 1965a. Maximum matching and a polyhedron with 0,1 vertices. Journal of Research of the National Bureau of Standards, 69, 125–130.Google Scholar

Edmonds, Jack. 1965b. Paths, trees, and flowers. Canadian Journal of Mathematics, 17(3), 449–467.Google Scholar

Edmonds, Jack, and Karp, Richard M. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the Association for Computing Machinery, 19(2), 248–264.Google Scholar

Eisenberg, Edmund, and Gale, David. 1959. Consensus of subjective probabilities: the pari-mutuel method. Annals of Mathematical Statistics, 30(1), 165–168.Google Scholar

Farkas, Julius. 1902. Theorie der einfachen Ungleichungen. Journal für die reine und angewandte Mathematik, 124, 1–27.Google Scholar

Feige, Uriel. 2008. On estimation algorithms vs approximation algorithms. Pages 357– 363 of: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), vol. 2. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.Google Scholar

Ford, L. R., and Fulkerson, D. R. 1956. Maximal flow in a network. Canadian Journal of Mathematics, 8, 399–404.CrossRefGoogle Scholar

Galántai, A. 2000. The theory of Newton’s method. Journal of Computational and Applied Mathematics, 124(1), 25–44. Special Issue: Numerical Analysis 2000. Vol. IV: Optimization and Nonlinear Equations.Google Scholar

Garg, Jugal, Mehta, Ruta, Sohoni, Milind A., and Vishnoi, Nisheeth K. 2013. Towards polynomial simplex-like algorithms for market equlibria. Pages 1226–1242 of: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, January 6–8, New Orleans, LA.Google Scholar

Garg, Naveen, and Könemann, Jochen. 2007. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM Journal on Computing, 37(2), 630–652.Google Scholar

Gärtner, Bernd, and Matousek, Jirí. 2014. Approximation Algorithms and Semidefinite Programming. Berlin, Heidelberg: Springer.Google Scholar

Gibbs, J. (2010). Elementary Principles in Statistical Mechanics: Developed with Especial Reference to the Rational Foundation of Thermodynamics. Cambridge: Cambridge University Press.CrossRefGoogle Scholar

Goldberg, A., and Tarjan, R. 1987. Solving minimum-cost flow problems by successive approximation. Pages 7–18 of: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, May 25–27, New York, NY.Google Scholar

Goldberg, Andrew V., and Rao, Satish. 1998. Beyond the flow decomposition barrier. Journal of the Association for Computing Machinery, 45(5), 783–797.Google Scholar

Golub, G. H., and Van Loan, C. F. 1996. Matrix Computations. Baltimore, MD: Johns Hopkins University Press.Google Scholar

Gonzaga, C. C. (1989) An algorithm for solving linear programming problems in O(n³L) operations. Pages 1–28 of: Megiddo, N. (ed.), Progress in Mathematical Programming. NewYork,NY:Springer.Google Scholar

Grötschel, M., Lovász, L., and Schrijver, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2), 169–197.CrossRefGoogle Scholar

Grötschel, Martin, Lovász, Lászlo, and Schrijver, Alexander. 1988. Geometric Algorithms and Combinatorial Optimization. Vol.2:Algorithms and Combinatorics. Berlin, Heidelberg: Springer-Verlag.Google Scholar

Gurjar, Rohit, Thierauf, Thomas, and Vishnoi, Nisheeth K. 2018. Isolating a vertex via lattices: polytopes with totally unimodular faces. Pages 74:1–74:14 of: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9–13, Prague, Czech Republic. LIPIcs, vol. 107.Google Scholar

Hazan, Elad. 2016. Introduction to online convex optimization. Foundations and Trends in Optimization, 2(3–4), 157–325.Google Scholar

Hestenes, Magnus R., and Stiefel, Eduard. 1952. Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards, 49(Dec.), 409–436.Google Scholar

Hopcroft, John E., and Karp, Richard M. 1973. An n⁵^/² algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4), 225–231.Google Scholar

Jaggi, Martin. 2013. Revisiting Frank-Wolfe: projection-free sparse convex optimization. Pages I-427–I-435 of: Proceedings of the 30th International Conference on International Conference on Machine Learning – Volume 28, ICML 2013, June 16–21, Atlanta, GA. JMLR.org.Google Scholar

Jain, Prateek, and Kar, Purushottam. 2017. Non-convex optimization for machine learning. Foundations and Trends in Machine Learning, 10(3–4), 142–336.Google Scholar

Jaynes, Edwin T. 1957a. Information theory and statistical mechanics. Physical Review, 106(May), 620–630.Google Scholar

Jaynes, Edwin T. 1957b. Information theory and statistical mechanics. II. Physical Review, 108(Oct.), 171–190.Google Scholar

Karlin, Anna R., Klein, Nathan, and Oveis Gharan, Shayan. 2020. A (slightly) improved approximation algorithm for metric TSP. CoRR, abs/2007.01409.Google Scholar

Karmarkar, Narendra. 1984. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4), 373–395.Google Scholar

Karp, Richard M., and Papadimitriou, Christos H. 1982. On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing, 11(4), 620–632.Google Scholar

Karzanov, Alexander V. 1973. On finding maximum flows in networks with special structure and some applications. Matematicheskie Voprosy Upravleniya Proizvodstvom, 5, 81–94.Google Scholar

Kelner, Jonathan A., Lee, Yin Tat, Orecchia, Lorenzo, and Sidford, Aaron. 2014. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. Pages 217–226 of: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, January 5–7, Portland, OR.Google Scholar

Khachiyan, L. G. 1979. A polynomial algorithm for linear programming. Doklady Akademii Nauk SSSR, 224(5), 1093–1096.Google Scholar

Khachiyan, L. G. 1980. Polynomial algorithms in linear programming. USSR Computational Mathematics and Mathematical Physics, 20(1), 53–72.Google Scholar

Klee, V., and Minty, G. J. 1972. How good is the simplex algorithm? Pages 159–175 of: Shisha, O. (ed.), Inequalities III. New York, NY: Academic Press.Google Scholar

Kleinberg, Jon, and Tardos, Eva. 2005. Algorithm Design. Boston, MA: Addison-Wesley Longman.Google Scholar

Krantz, S. G. 2014. Convex Analysis. Textbooks in Mathematics. Boca Raton, FL: CRC Press.Google Scholar

Lau, Lap-Chi, Ravi, R., and Singh, Mohit. 2011. Iterative Methods in Combinatorial Optimization. New York, NY: Cambridge University Press.Google Scholar

Leake, Jonathan, and Vishnoi, Nisheeth K. 2020. On the computability of continuous maximum entropy distributions with applications. Pages 930–943 of: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, June 22–26, Chicago, IL.Google Scholar

Lee, Yin Tat, Rao, Satish, and Srivastava, Nikhil. 2013. A new approach to computing maximum flows using electrical flows. Pages 755–764 of: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing. STOC 2013, June 1–4, Palo Alto, CA.Google Scholar

Lee, Yin Tat, and Sidford, Aaron. 2014. Path finding methods for linear programming: solving linear programs in Õ(vrank) iterations and faster algorithms for maximum flow. Pages 424–433 of: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, October 18–21, Philadelphia, PA.Google Scholar

Lee, Yin Tat, Sidford, Aaron, and Wong, Sam Chiu-wai. 2015. A faster cutting plane method and its implications for combinatorial and convex optimization. Pages 1049–1065 of: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, October, Berkeley, CA.Google Scholar

Louis, Anand, and Vempala, Santosh S. 2016. Accelerated Newton iteration for roots of black box polynomials. Pages 732–740 of: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, October 9–11, New Brunswick, NJ.Google Scholar

Lovász, László. 1983. Submodular functions and convexity. Pages 235–257 of: Bachem, A., Korte, B., and Grötschel, M. (eds.), Mathematical Programming: The State of the Art. Berlin, Heidelberg: Springer.Google Scholar

Madry, Aleksander. 2013. Navigating central path with electrical flows: from flows to matchings, and back. Pages 253–262 of: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, October 26–29, Berkeley, CA.Google Scholar

Mulmuley, Ketan, Vazirani, Umesh V., and Vazirani, Vijay V. 1987. Matching is as easy as matrix inversion. Combinatorica, 7, 105–113.Google Scholar

Nakagaki, Toshiyuki, Yamada, Hiroyasu, and Toth, Agota. 2000. Maze-solving by an amoeboid organism. Nature, 407(6803), 470.Google Scholar

Nemirovski, A., and Yudin, D. 1983. Problem Complexity and Method Efficiency in Optimization. Translated by E. R. Dawson. Chichester: Wiley.Google Scholar

Nesterov, Y., and Nemirovskii, A. 1994. Interior-Point Polynomial Algorithms in Convex Programming. Philadelphia, PA: Society for Industrial and Applied Mathematics.Google Scholar

Nesterov, Yurii. 1983. A method for unconstrained convex minimization problem with the rate of convergence O(1/k²). Dokl. akad. nauk Sssr, 269, 543–547.Google Scholar

Nesterov, Yurii. 2004. Introductory Lectures on Convex Optimization. Vol. 87. New York: Springer Science & Business Media.Google Scholar

Orecchia, Lorenzo, Sachdeva, Sushant, and Vishnoi, Nisheeth K. 2012. Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator. Pages 1141–1160 of: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing. STOC 2012, May 19–22, New York, NY.Google Scholar

Orecchia, Lorenzo, Schulman, Leonard J., Vazirani, Umesh V., and Vishnoi, Nisheeth K. 2008. On partitioning graphs via single commodity flows. Pages 461– 470 of: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, May 17–20, Victoria, British Columbia.Google Scholar

Gharan, Oveis, Shayan, Saberi, Amin, , and Singh, Mohit. 2011. A randomized rounding approach to the traveling salesman problem. Pages 267–276 of: FOCS’11: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, October 22–25, 2011, Palm Springs, CA.Google Scholar

Padberg, Manfred W., and Rao, M. Rammohan. 1981. The Russian Method for Linear Inequalities III: Bounded Integer Programming. Ph.D. thesis, INRIA.Google Scholar

Pan, Victor Y., and Chen, Zhao Q. 1999. The complexity of the matrix eigenproblem. Pages 507–516 of: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, STOC 1999, May 1–4, Atlanta, GA.Google Scholar

Peng, Richard. 2016. Approximate undirected maximum flows in O(m polylog(n)) time. Pages 1862–1867 of: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, January 10–12, Arlington, VA.Google Scholar

Perko, Lawrence. 2001. Differential Equations and Dynamical Systems. Vol.7.New York, NY: Springer-Verlag.Google Scholar

Plotkin, Serge A., Shmoys, David B., and Tardos, Éva. 1995. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20(2), 257–301.Google Scholar

Polyak, Boris. 1964. Some methods of speeding up the convergence of iteration methods. USSR Computational Mathematics and Mathematical Physics, 4(12), 1–17.Google Scholar

Renegar, James. 1988. A polynomial-time algorithm, based on Newton’s method, for linear programming. Mathematical Programming, 40(1–3), 59–93.Google Scholar

Renegar, James. 2001. A Mathematical View of Interior-Point Methods in Convex Optimization. Philadephia, PA: Society for Industrial and Applied Mathematics.Google Scholar

Rockafellar, R. Tyrrell. 1970. Convex Analysis. Princeton Mathematical Series. Princeton, NJ: Princeton University Press.Google Scholar

Rothvoss, Thomas. 2017. The matching polytope has exponential extension complexity. Journal of the Association for Computing Machinery, 64(6), 41:1–41:19.Google Scholar

Rudin, Walter. 1987. Real and Complex Analysis. 3rd ed. New York: McGraw-Hill.Google Scholar

Saad, Y. 2003. Iterative Methods for Sparse Linear Systems. 2nd ed. Philadelphia, PA: Society for Industrial and Applied Mathematics.Google Scholar

Sachdeva, Sushant, and Vishnoi, Nisheeth K. 2014. Faster algorithms via approximation theory. Foundations and Trends in Theoretical Computer Science, 9(2), 125–210.Google Scholar

Schrijver, Alexander. 2002a. Combinatorial Optimization: Polyhedra and Efficiency. Vol. 24. Berlin, Heidelberg: Springer-Verlag.Google Scholar

Schrijver, Alexander. 2002b. On the history of the transportation and maximum flow problems. Mathematical Programming, 91(3), 437–445.CrossRefGoogle Scholar

Shalev-Shwartz, Shai. 2012. Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.Google Scholar

Sherman, Jonah. 2013. Nearly maximum flows in nearly linear time. Pages 263–269 of: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, October, 26–29, Berkeley, CA.Google Scholar

Shor, N. Z. 1972. Utilization of the operation of space dilatation in the minimization of convex functions. Cybernetics, 6(1), 7–15.Google Scholar

Singh, Mohit, and Vishnoi, Nisheeth K. 2014. Entropy, optimization and counting. Pages 50–59 of: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, May 31–June 3, New York, NY.Google Scholar

Spielman, Daniel A. 2012. Algorithms, graph theory, and the solution of Laplacian linear equations. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds), Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol. 7392. Berlin, Heidelberg: Springer.Google Scholar

Spielman, Daniel A., and Teng, Shang-Hua. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. Pages 81–90 of: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, STOC 2004, June 13–16, Chicago, IL.Google Scholar

Spielman, Daniel A., and Teng, Shang-Hua. 2009. Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Communications of the Association for Computing Machinery, 52(10), 76–84.Google Scholar

Steele, J. Michael. 2004. The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities. New York, NY: Cambridge University Press.Google Scholar

Strang, Gilbert. 1993. The fundamental theorem of linear algebra. American Mathematical Monthly, 100(9), 848–855.Google Scholar

Strang, Gilbert. 2006. Linear Algebra and Its Applications. Belmont, CA: Thomson, Brooks/Cole.Google Scholar

Straszak, Damian, and Vishnoi, Nisheeth K. 2016a. Natural algorithms for flow problems. Pages 1868–1883 of: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, January 10–12, Arlington, VA.Google Scholar

Straszak, Damian, and Vishnoi, Nisheeth K. 2016b. On a natural dynamics for linear programming. Page 291 of: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, January 14–16, Cambridge, MA.Google Scholar

Straszak, Damian, and Vishnoi, Nisheeth K. 2017. Real stable polynomials and matroids: optimization and counting. Pages 370–383 of: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, June 19–23, Montreal, Quebec.Google Scholar

Straszak, Damian, and Vishnoi, Nisheeth K. 2019. Maximum entropy distributions: bit complexity and stability. Pages 2861–2891 of: Conference on Learning Theory, COLT 2019, June 25–28, Phoenix, AZ. Proceedings of Machine Learning Research, vol. 99.Google Scholar

Straszak, Damian, and Vishnoi, Nisheeth K. 2021. Iteratively reweighted least squares and slime mold dynamics: connection and convergence. Mathematical Programming Series A, 2021.Google Scholar

Teng, Shang-Hua. 2010. The Laplacian paradigm: emerging algorithms for massive graphs. In: Kratochvíl, J., Li, A., Fiala, J., and Kolman, P. (eds.), Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol. 6108. Berlin, Heidelberg: Springer.Google Scholar

Trefethen, Lloyd N., and Bau, David. 1997. Numerical Linear Algebra. Philadelphia, PA: SIAM.Google Scholar

Vaidya, Pravin M. 1987. An algorithm for linear programming which requires O(((m+ n)n² + (m+ n)^1.5n)L) arithmetic operations. Pages 29–38 of: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, May 25–27, New York, NY.2+++(m++n)^1.5n)L)+arithmetic+operations.+Pages+29–38+of:+Proceedings+of+the+19th+Annual+ACM+Symposium+on+Theory+of+Computing,+May+25–27,+New+York,+NY.>Google Scholar

Vaidya, Pravin M. 1989a. A new algorithm for minimizing convex functions over convex sets (extended abstract). Pages 338–343 of: 30th Annual Symposium on Foundations of Computer Science, October 30–November 1, Research Triangle Park, NC.Google Scholar

Vaidya, Pravin M. 1989b. Speeding-Up linear programming using fast matrix multiplication (extended abstract). Pages 332–337 of: 30th Annual Symposium on Foundations of Computer Science, October 30–November 1, Research Triangle Park, NC.Google Scholar

Vaidya, Pravin M. 1990. Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Unpublished manuscript, University of Illinois, Urbana-Champaign.Google Scholar

Valiant, Leslie G. 1979. The complexity of computing the permanent. Theoretical Computer Science, 8, 189–201.Google Scholar

van den Brand, Jan, Lee, Yin-Tat, Nanongkai, Danupon, Peng, Richard, Saranurak, Thatchaphol, Sidford, Aaron, Song, Zhao, and Wang, Di. 2020. Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. Pages 919–930 of: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).Google Scholar

Vanderbei, Robert J. 2001. The Affine-Scaling Method. In: Linear Programming. International Series in Operations Research and Management Science, vol. 114. Boston, MA: Springer.Google Scholar

Vazirani, Vijay V. 2012. The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. Journal of the Association for Computing Machinery, 59(2).Google Scholar

Vishnoi, Nisheeth K. 2013. Lx = b. Foundations and Trends in Theoretical Computer Science, 8(1–2), 1–141.Google Scholar

Vishnoi, Nisheeth K. 2018. Geodesic convex optimization: differentiation on manifolds, geodesics, and convexity. CoRR, abs/1806.06373.Google Scholar

Wright, Margaret H. 2005. The interior-point revolution in optimization: history, recent developments, and lasting consequences. Bulletin of the American Mathematical Society (N.S.), 42, 39–56.Google Scholar

Wright, Stephen J. 1997. Primal-Dual Interior-Point Methods. Philadelphia, PA: Society for Industrial and Applied Mathematics.Google Scholar

Yudin, D. B., and Nemirovskii, Arkadi S. 1976. Informational complexity and efficient methods for the solution of convex extremal problems. Ékon Math Metod, 12, 357–369.Google Scholar

Zhu, Zeyuan Allen, Li, Yuanzhi, de Oliveira, Rafael Mendes, and Wigderson, Avi. 2017. Much faster algorithms for matrix scaling. Pages 890–901 of: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, October 15–17, Berkeley, CA.Google Scholar