APA (7th ed.) Citation

Lin, Q., Ma, R., & Xu, Y. (2022). Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization. Computational Optimization & Applications, 82(1), 175. https://doi.org/10.1007/s10589-022-00358-y

Chicago Style (17th ed.) Citation

Lin, Qihang, Runchao Ma, and Yangyang Xu. "Complexity of an Inexact Proximal-point Penalty Method for Constrained Smooth Non-convex Optimization." Computational Optimization & Applications 82, no. 1 (2022): 175. https://doi.org/10.1007/s10589-022-00358-y.

MLA (9th ed.) Citation

Lin, Qihang, et al. "Complexity of an Inexact Proximal-point Penalty Method for Constrained Smooth Non-convex Optimization." Computational Optimization & Applications, vol. 82, no. 1, 2022, p. 175, https://doi.org/10.1007/s10589-022-00358-y.