A filled function method for quadratic programs with binary constraints

Author： Wu Z. Y.  

Publisher： Taylor & Francis Ltd

ISSN： 0233-1934

Source： Optimization, Vol.58, Iss.5, 2009-07, pp. : 585-598

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 semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints

By Izmailov A.  

Computational Mathematics and Mathematical Physics, Vol. 51, Iss. 6, 2011-06 ,pp. : 919-941

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Novel Filled Function Method and Quasi-Filled Function Method for Global Optimization

By Wu Z.   Lee H.   Zhang L.   Yang X.  

Computational Optimization and Applications, Vol. 34, Iss. 2, 2006-06 ,pp. : 249-272

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

Sufficient Conditions for Global Optimality of Bivalent Nonconvex Quadratic Programs with Inequality Constraints

By Wu Z.   Jeyakumar V.   Rubinov A.  

Journal of Optimization Theory and Applications, Vol. 133, Iss. 1, 2007-04 ,pp. : 123-130

Springer Publishing Company

Access to resources Recommend Favorite

New optimality conditions for quadratic optimization problems with binary constraints

By Xia Yong  

Optimization Letters, Vol. 3, Iss. 2, 2009-03 ,pp. : 253-263

Springer Publishing Company

Access to resources Recommend Favorite