A Modified Projection Algorithm for Large Strictly-Convex Quadratic Programs

ISSN： 0022-3239

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

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 proximal subgradient projection algorithm for linearly constrained strictly convex problems

By Ouorou Adam

Optimization Methods and Software, Vol. 22, Iss. 4, 2007-08 ,pp. : 617-636

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs

By Yamamoto R. Konno H.

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

Springer Publishing Company

Access to resources Recommend Favorite

Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations

By Phu H. Pho V. An P.

Journal of Optimization Theory and Applications, Vol. 149, Iss. 1, 2011-04 ,pp. : 1-25

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

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