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

Author： Altman A.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

An &unknown;-sensitivity analysis in the primal-dual interior point method

By Kim W.-J.   Park C.-K.   Park S.  

European Journal of Operational Research, Vol. 116, Iss. 3, 1999-08 ,pp. : 629-639

Elsevier

Access to resources Recommend Favorite

Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm

By Arbel A.   Oren S.S.  

European Journal of Operational Research, Vol. 89, Iss. 1, 1996-02 ,pp. : 202-211

Elsevier

Access to resources Recommend Favorite

HOPDM (version 2.12) - A fast LP solver based on a primal-dual interior point method

By Gondzio J.  

European Journal of Operational Research, Vol. 85, Iss. 1, 1995-08 ,pp. : 221-225

Elsevier

Access to resources Recommend Favorite

A new penalty function algorithm for convex quadratic programming

By Ben-Daya M.   Al-Sultan K.S.  

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

Elsevier

Access to resources Recommend Favorite

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