Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods
© 2017 IEEE. In this paper, we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring logarithmic factors involving the dimension of the in...
Main Authors: | Cohen, Michael B., Madry, Aleksander, Tsipras, Dimitris, Vladu, Adrian |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
IEEE
2021
|
Online Access: | https://hdl.handle.net/1721.1/137768 |
Similar Items
-
Faster algorithms for matrix scaling and balancing via convex optimization
by: Tsipras, Dimitris
Published: (2017) -
Quantum gradient descent and Newton’s method for constrained polynomial optimization
by: Rebentrost, Frank Patrick, et al.
Published: (2020) -
Negative-Weight shortest paths and unit capacity minimum cost flow in Õ(m[superscript 10/7] log W) Time
by: Sankowski, Piotr, et al.
Published: (2018) -
A matrix-free quasi-Newton method for solving large-scale nonlinear systems.
by: Leong, Wah June, et al.
Published: (2011) -
How does batch normalization help optimization?
by: Madry, Aleksander, et al.
Published: (2021)