Cita APA (7a ed.)

Brilli, A., Kimiaei, M., Liuzzi, G., & Lucidi, S. (2023). Worst case complexity bounds for linesearch-type derivative-free algorithms.

Cita Chicago Style (17a ed.)

Brilli, Andrea, Morteza Kimiaei, Giampaolo Liuzzi, y Stefano Lucidi. Worst Case Complexity Bounds for Linesearch-type Derivative-free Algorithms. 2023.

Cita MLA (9a ed.)

Brilli, Andrea, et al. Worst Case Complexity Bounds for Linesearch-type Derivative-free Algorithms. 2023.