A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints

ISSN： 0926-6003

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

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

Redundancies in Positive-Semidefinite Quadratic Programming

By Recht P.

Journal of Optimization Theory and Applications, Vol. 119, Iss. 3, 2003-12 ,pp. : 553-564

Springer Publishing Company

Access to resources Recommend Favorite

From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems

By Roupin Frédéric

Journal of Combinatorial Optimization, Vol. 8, Iss. 4, 2004-12 ,pp. : 469-493

Springer Publishing Company

Access to resources Recommend Favorite

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

By Li Jianling Wang Peng Ma Lin

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

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

Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints

By Hu X. M. Ralph D.

Journal of Optimization Theory and Applications, Vol. 123, Iss. 2, 2004-11 ,pp. : 365-390

Springer Publishing Company

Access to resources Recommend Favorite