Characterization of optimal points in binary convex quadratic programming

ISSN： 0233-1934

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

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

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

Adaptive constraint reduction for convex quadratic programming

By Jung Jin

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 125-157

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

Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming

By Recht P. Schade P.H.

Optimization, Vol. 56, Iss. 4, 2007-08 ,pp. : 495-514

Taylor & Francis Ltd

Access to resources Recommend Favorite