A new penalty function algorithm for convex quadratic programming

Author： Ben-Daya M.   Al-Sultan K.S.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.101, Iss.1, 1997-08, pp. : 155-163

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 simple duality proof in convex quadratic programming with a quadratic constraint, and some applications

By Pinar M.C.  

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 151-158

Elsevier

Access to resources Recommend Favorite

A smooth penalty function algorithm for network-structured problems

By Zenios S.A.   Pinar M.C.   Dembo R.S.  

European Journal of Operational Research, Vol. 83, Iss. 1, 1995-05 ,pp. : 220-236

Elsevier

Access to resources Recommend Favorite

Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case

By Heesang L.   Nemhauser G.L.   Yinhua W.  

European Journal of Operational Research, Vol. 94, Iss. 1, 1996-10 ,pp. : 154-166

Elsevier

Access to resources Recommend Favorite

On computing objective function values in multiple objective quadratic-linear programming

By Korhonen P.   Yu G.Y.  

European Journal of Operational Research, Vol. 106, Iss. 1, 1998-04 ,pp. : 184-190

Elsevier

Access to resources Recommend Favorite

QHOPDM - A higher order primal-dual method for large scale convex quadratic programming

By Altman A.  

European Journal of Operational Research, Vol. 87, Iss. 1, 1995-11 ,pp. : 200-202

Elsevier

Access to resources Recommend Favorite