Indexed metadata
Strong and Total Lagrange Dualities for Quasiconvex Programming
Donghui Fang, XianFa Luo, Xianyun Wang
Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.