Benchmarking large-scale distributed convex quadratic programming algorithms

Author： Kozma Attila   Conte Christian   Diehl Moritz  

Publisher： Taylor & Francis Ltd

E-ISSN： 1029-4937|30|1|191-214

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.30, Iss.1, 2015-01, pp. : 191-214

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming

By Pham Dinh T.   Le Thi H.A.   Akoa F.  

Optimization Methods and Software, Vol. 23, Iss. 4, 2008-08 ,pp. : 609-629

Taylor & Francis Ltd

Access to resources Recommend Favorite

Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints

By Cafieri S.   D’Apuzzo M.   Marino M.   Mucherino A.   Toraldo G.  

Journal of Optimization Theory and Applications, Vol. 129, Iss. 1, 2006-04 ,pp. : 55-75

Springer Publishing Company

Access to resources Recommend Favorite

Very large scale optimization by sequential convex programming

By Zillober Ch.   Schittkowski K.   Moritzen K.  

Optimization Methods and Software, Vol. 19, Iss. 1, 2004-02 ,pp. : 103-120

Taylor & Francis Ltd

Access to resources Recommend Favorite

Method based on dual-quadratic programming for frame structural optimization with large scale

By Sui Yun-kang   Du Jia-zheng   Guo Ying-qiao  

Applied Mathematics and Mechanics, Vol. 27, Iss. 3, 2006-03 ,pp. : 383-391

Springer Publishing Company

Access to resources Recommend Favorite

Sparsity in convex quadratic programming with interior point methods

By Mészáros Csaba  

Optimization Methods and Software, Vol. 21, Iss. 5, 2006-10 ,pp. : 733-745

Taylor & Francis Ltd

Access to resources Recommend Favorite