Quasiconvex Semidefinite Minimization Problem | Zendy

Rentsen Enkhbat | Zendy; T. Bayartugs | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Quasiconvex Semidefinite Minimization Problem

Author(s) -

Rentsen Enkhbat,

T. Bayartugs

Publication year - 2013

Publication title -

journal of optimization

Language(s) - English

Resource type - Journals

eISSN - 2356-752X

pISSN - 2314-6486

DOI - 10.1155/2013/346131

Subject(s) - quasiconvex function , minification , mathematical optimization , sequence (biology) , mathematics , semidefinite programming , construct (python library) , semidefinite embedding , computer science , quadratically constrained quadratic program , convex optimization , regular polygon , convex analysis , geometry , biology , genetics , programming language , quadratic programming

We introduce so-called semidefinite quasiconvex minimization problem. We derive new global optimality conditions for the above problem. Based on the global optimality conditions, we construct an algorithm which generates a sequence of local minimizers which converge to a global solution

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