A new algorithm for the general quadratic programming problems with box constraints

Author： Li Jianling   Wang Peng   Ma Lin  

Publisher： Springer Publishing Company

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.55, Iss.1, 2010-09, pp. : 79-85

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

Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints

By Thoai N.V.  

Journal of Optimization Theory and Applications, Vol. 107, Iss. 2, 2000-11 ,pp. : 331-354

Springer Publishing Company

Access to resources Recommend Favorite

A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints

By Braun Stephen   Mitchell John  

Computational Optimization and Applications, Vol. 31, Iss. 1, 2005-05 ,pp. : 5-29

Springer Publishing Company

Access to resources Recommend Favorite

A sequential method for a class of box constrained quadratic programming problems

By Cambini Riccardo  

Mathematical Methods of Operations Research, Vol. 67, Iss. 2, 2008-04 ,pp. : 223-243

Springer Publishing Company

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

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