An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.133, Iss.2, 2007-05, pp. : 241-255

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 efficient compact quadratic convex reformulation for general integer quadratic programs

By Billionnet Alain

Computational Optimization and Applications, Vol. 54, Iss. 1, 2013-01 ,pp. : 141-162

Springer Publishing Company

Access to resources Recommend Favorite

Perturbing the Dual Feasible Region for Solving Convex Quadratic Programs

By Fang S.C. Tsao H.S.J.

Journal of Optimization Theory and Applications, Vol. 94, Iss. 1, 1997-07 ,pp. : 73-85

Springer Publishing Company

Access to resources Recommend Favorite

A Modified Projection Algorithm for Large Strictly-Convex Quadratic Programs

By Ruggiero V. Zanni L.

Journal of Optimization Theory and Applications, Vol. 104, Iss. 2, 2000-02 ,pp. : 255-279

Springer Publishing Company

Access to resources Recommend Favorite

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs

By Mitchell John E. Pang Jong-Shi Yu Bin

Optimization Methods and Software, Vol. 29, Iss. 1, 2014-01 ,pp. : 120-136

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Note on Convex Reformulation Schemes for Mixed Integer Quadratic Programs

By Newby Eric Ali M.

Journal of Optimization Theory and Applications, Vol. 160, Iss. 2, 2014-02 ,pp. : 457-469

Springer Publishing Company

Access to resources Recommend Favorite