2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.OC2020★ 2 cited
Convergence and Complexity Analysis of a Levenberg-Marquardt Algorithm for Inverse Problems
E. Bergou, Y. Diouane, V. Kungurtsev
The Levenberg-Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems. Across different modified variations of the ba…
math.OC2020
Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure
E. Bergou, Y. Diouane, V. Kungurtsev
In this note we consider the iteration complexity of solving strongly convex multi objective optimization. We discuss the precise meaning of this problem, and indicate it is loosel…