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

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

Publisher： Springer Publishing Company

ISSN： 0022-3239

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

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

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

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

A primal-dual interior-point algorithm for quadratic programming

By Dominguez Juan   González-Lima María  

Numerical Algorithms, Vol. 42, Iss. 1, 2006-05 ,pp. : 1-30

Springer Publishing Company

Access to resources Recommend Favorite

A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints

By Xu Song  

Computational Optimization and Applications, Vol. 27, Iss. 3, 2004-03 ,pp. : 285-303

Springer Publishing Company

Access to resources Recommend Favorite

Interior-Point Gradient Method for Large-Scale Totally Nonnegative Least Squares Problems

By Merritt M.   Zhang Y.  

Journal of Optimization Theory and Applications, Vol. 126, Iss. 1, 2005-07 ,pp. : 191-202

Springer Publishing Company

Access to resources Recommend Favorite