Strong and Total Lagrange Dualities for Quasiconvex Programming | Zendy

Donghui Fang | Zendy; Xian-Fa Luo | Zendy; Xianyun Wang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Strong and Total Lagrange Dualities for Quasiconvex Programming

Author(s) -

Donghui Fang,

Xian-Fa Luo,

Xianyun Wang

Publication year - 2014

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2014/453912

Subject(s) - quasiconvex function , subderivative , constraint (computer aided design) , mathematical optimization , mathematics , lagrange multiplier , computer science , convex optimization , regular polygon , geometry

We consider the strong and total Lagrange dualities for infinite quasiconvex optimization problems. By using the epigraphs of the z-quasi-conjugates and the Greenberg-Pierskalla subdifferential of these functions, we introduce some new constraint qualifications. Under the new constraint qualifications, we provide some necessary and sufficient conditions for infinite quasiconvex optimization problems to have the strong and total Lagrange dualities

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