Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference23 articles.
1. Polyak, B. T., andTreti'akov, N. V.,An Iterative Method for Linear Programming and Its Economic Interpretation, Matekon, Vol. 8, pp. 81–100, 1972.
2. Güler, O.,New Proximal Point Algorithms for Convex Minimization, SIAM Journal on Optimization (to appear November 1992).
3. Bertsekas, D. P.,Necessary and Sufficient Conditions for a Penalty Method to Be Exact, Mathematical Programming, Vol. 9, pp. 87–99, 1975.
4. Rockafellar, R. T.,Monotone Operators and the Proximal Point Algorithm, SIAM Journal on Control and Optimization, Vol. 14, pp. 877–898, 1976.
5. Lin, Y. Y., andPang, J. S.,Iterative Methods for Large Convex Quadratic Programming: A Survey, SIAM Journal on Control and Optimization, Vol. 25, pp. 383–411, 1987.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献