Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference16 articles.
1. Al-Sultan, K.S., Murty, K.G.: Nearest points in nonsimplicial cones and LCPs with PSD symmetric matrices. In: Recent Developments in Mathematical Programming. Gordon and Breach Science Publishers, Philadelphia (1991). Edited by Santosh Kumar on behalf of the Australian Society for Operations Research
2. Anstreicher, K.M., Hertog, D.D., Ross, C., Terlaky, T.: A long-step Barrier method for convex quadratic programming. Algorithmica 10, 365–382 (1993)
3. Fang, S.C.: An iterative method for generalized complementarity problems. IEEE Trans. Automat. Contr. AC 25, 1225–1227 (1980)
4. Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27, 1–33 (1983)
5. Goldfarb, D., Liu, S.: An O(n 3 L) primal interior point algorithm for convex quadratic programming. Math. Program. 49, 325–340 (1990)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献