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

ISSN： 0233-1934

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

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

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

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

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

Globally Convergent Interior-Point Algorithm for Nonlinear Programming

By Akrotirianakis I. Rustem B.

Journal of Optimization Theory and Applications, Vol. 125, Iss. 3, 2005-06 ,pp. : 497-521

Springer Publishing Company

Access to resources Recommend Favorite

Newton-KKT interior-point methods for indefinite quadratic programming

By Absil P.-A. Tits André

Computational Optimization and Applications, Vol. 36, Iss. 1, 2007-01 ,pp. : 5-41

Springer Publishing Company

Access to resources Recommend Favorite