Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints

Author： Bai Lijie   Mitchell John   Pang Jong-Shi  

Publisher： Springer Publishing Company

ISSN： 1862-4472

Source： Optimization Letters, Vol.8, Iss.3, 2014-03, pp. : 811-822

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

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

Convex LPV synthesis of estimators and feedforwards using duality and integral quadratic constraints

By  

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Vol. 28, Iss. 3, 2018-02 ,pp. : 953-975

John Wiley & Sons Inc

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

Convex Quadratic Approximation

By Rosen J. Ben   Marcia Roummel F.  

Computational Optimization and Applications, Vol. 28, Iss. 2, 2004-07 ,pp. : 173-184

Springer Publishing Company

Access to resources Recommend Favorite

Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming

By Recht P.   Schade P.H.  

Optimization, Vol. 56, Iss. 4, 2007-08 ,pp. : 495-514

Taylor & Francis Ltd

Access to resources Recommend Favorite