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

ISSN： 0926-6003

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

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

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

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

Long-Step Path-Following Algorithm for Convex Quadratic Programming Problems in a Hilbert Space

By Faybusovich L. Moore J.B.

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 615-635

Springer Publishing Company

Access to resources Recommend Favorite

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 non-interior continuation method for second-order cone programming

By Chi Xiaoni Liu Sanyang

Optimization, Vol. 58, Iss. 8, 2009-11 ,pp. : 965-979

Taylor & Francis Ltd

Access to resources Recommend Favorite