3 citations · 3 across the 2 of their papers we have counts for
2 papers
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.OC2019★ 3 cited
A robust method based on LOVO functions for solving least squares problems
E. V. Castelani, R. Lopes, W. V. I. Shirabayashi +1
The robust adjustment of nonlinear models to data is considered in this paper. When data comes from real experiments, it is possible that measurement errors cause the appearance of…