3 citations · 7 across the 5 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022
Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming
Jacek Gondzio, Francisco N. C. Sobral
Quasi-Newton methods are well known techniques for large-scale numerical optimization. They use an approximation of the Hessian in optimization problems or the Jacobian in system o…
math.OC2022★ 1 cited
On complexity constants of linear and quadratic models for derivative-free trust-region algorithms
A. E. Schwertner, F. N. C. Sobral
Complexity analysis has become an important tool in the convergence analysis of optimization algorithms. For derivative-free optimization algorithms, it is not different. Interesti…