37 citations · 39 across the 4 of their papers we have counts for
4 papers · 1 filter
Iteration Complexity of Fixed-Step Methods by Nesterov and Polyak for Convex Quadratic Functions
Melinda Hagedorn, Florian Jarre
This note considers the momentum method by Polyak and the accelerated gradient method by Nesterov, both without line search but with fixed step length applied to strictly convex qu…
Optimized convergence of stochastic gradient descent by weighted averaging
Melinda Hagedorn, Florian Jarre
Under mild assumptions stochastic gradient methods asymptotically achieve an optimal rate of convergence if the arithmetic mean of all iterates is returned as an approximate optima…
New results on the cp rank and related properties of co(mpletely)positive matrices
Naomi Shaked-Monderer, Abraham Berman, Immanuel M. Bomze +2
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The…
A sequential semidefinite programming method and an application in passive reduced-order modeling
Roland W. Freund, Florian Jarre, Christoph Vogelbusch
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The need for an efficient exploitation of the cone of positive semidefinite matrices mak…