Lu, Y., & Yuan, Y. (2008). An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints. Optimization methods & software, 23(2), 251-258. https://doi.org/10.1080/10556780701645057
Chicago-Zitierstil (17. Ausg.)Lu, Ye, und Ya-Xiang Yuan. "An Interior-point Trust-region Polynomial Algorithm for Convex Quadratic Minimization Subject to General Convex Constraints." Optimization Methods & Software 23, no. 2 (2008): 251-258. https://doi.org/10.1080/10556780701645057.
MLA-Zitierstil (9. Ausg.)Lu, Ye, und Ya-Xiang Yuan. "An Interior-point Trust-region Polynomial Algorithm for Convex Quadratic Minimization Subject to General Convex Constraints." Optimization Methods & Software, vol. 23, no. 2, 2008, pp. 251-258, https://doi.org/10.1080/10556780701645057.