An efficient algorithm for convex quadratic semi-definite optimization | Zendy

Lipu Zhang | Zendy; Yinghong Xu | Zendy; Zhengjing Jin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An efficient algorithm for convex quadratic semi-definite optimization

Author(s) -

Lipu Zhang,

Yinghong Xu,

Zhengjing Jin

Publication year - 2012

Publication title -

numerical algebra control and optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.303

H-Index - 20

eISSN - 2155-3289

pISSN - 2155-3297

DOI - 10.3934/naco.2012.2.129

Subject(s) - mathematics , quadratically constrained quadratic program , mathematical optimization , simple (philosophy) , quadratic equation , interior point method , quadratic function , quadratic programming , convex function , algorithm , function (biology) , convergence (economics) , convex optimization , positive definite matrix , path (computing) , regular polygon , computer science , philosophy , eigenvalues and eigenvectors , physics , geometry , epistemology , quantum mechanics , evolutionary biology , programming language , economics , biology , economic growth

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research