Curtis, F. E., Robinson, D. P., & Samadi, M. (2017). A trust region algorithm with a worst-case iteration complexity of O(ϵ-3/2) for nonconvex optimization. Mathematical programming, 162(1-2), 1-32. https://doi.org/10.1007/s10107-016-1026-2
Citace podle Chicago (17th ed.)Curtis, Frank E., Daniel P. Robinson, a Mohammadreza Samadi. "A Trust Region Algorithm with a Worst-case Iteration Complexity of O(ϵ-3/2) for Nonconvex Optimization." Mathematical Programming 162, no. 1-2 (2017): 1-32. https://doi.org/10.1007/s10107-016-1026-2.
Citace podle MLA (9th ed.)Curtis, Frank E., et al. "A Trust Region Algorithm with a Worst-case Iteration Complexity of O(ϵ-3/2) for Nonconvex Optimization." Mathematical Programming, vol. 162, no. 1-2, 2017, pp. 1-32, https://doi.org/10.1007/s10107-016-1026-2.