Publisher
Springer Science and Business Media LLC
Reference35 articles.
1. Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Mathematical Programming, Series A 87(1), 131–152 (2000)
2. Birge, J.R., Ho, J.K.: Optimal flows in stochastic dynamic networks with congestion. Oper. Res. 41(1), 203–216 (1993)
3. Bolte, J., Sabach, S., Teboulle, M.: Nonconvex lagrangian-based optimization: monitoring schemes and global convergence. Math. Oper. Res. 43(4), 1210–1232 (2018)
4. Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning 3(1), 1–122 (2010)
5. Burke, J.V., Engle, A.: Line search and trust-region methods for convex-composite optimization, arXiv preprint, arXiv:1806.05218 (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献