Bian, W., Chen, X., & Ye, Y. (2015). Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Mathematical programming, 149(1-2), 301-327. https://doi.org/10.1007/s10107-014-0753-5
Chicago Style (17th ed.) CitationBian, Wei, Xiaojun Chen, and Yinyu Ye. "Complexity Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization." Mathematical Programming 149, no. 1-2 (2015): 301-327. https://doi.org/10.1007/s10107-014-0753-5.
MLA (9th ed.) CitationBian, Wei, et al. "Complexity Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization." Mathematical Programming, vol. 149, no. 1-2, 2015, pp. 301-327, https://doi.org/10.1007/s10107-014-0753-5.
Warning: These citations may not always be 100% accurate.