Publisher
Springer Berlin Heidelberg
Reference76 articles.
1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5(1):13–51, 1995.
2. K. Anstreicher and L.A. Wolsey. On dual solutions in subgradient opimization. Unpublished manuscript, CORE, Louvain-la-Neuve, Belgium, 1993.
3. D.P. Bertsekas. Projected Newton methods for optimization problems with simple constraints. SIAM Journal on Control and Optimization, 20:221–246, 1982.
4. M.J. Best. Equivalence of some quadratic programming algorithms. Mathematical Programming, 30:71–87, 1984.
5. U. Brännlund. On relaxation methods for nonsmooth convex optimization. PhD thesis, Royal Institute of Technology-Stockholm, 1993.
Cited by
98 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献