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

Characterization of optimal points in binary convex quadratic programming

By Recht Peter  

Optimization, Vol. 56, Iss. 1-2, 2007-02 ,pp. : 39-47

Taylor & Francis Ltd

Access to resources Recommend Favorite

Convex programming with single separable constraint and bounded variables

By Dahiya Kalpana   Suneja Surjeet   Verma Vanita  

Computational Optimization and Applications, Vol. 36, Iss. 1, 2007-01 ,pp. : 67-82

Springer Publishing Company

Access to resources Recommend Favorite

An inexact spectral bundle method for convex quadratic semidefinite programming

By Lin Huiling  

Computational Optimization and Applications, Vol. 53, Iss. 1, 2012-09 ,pp. : 45-89

Springer Publishing Company

Access to resources Recommend Favorite

Benchmarking large-scale distributed convex quadratic programming algorithms

By Kozma Attila   Conte Christian   Diehl Moritz  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite