Duality and optimality conditions for reverse convex programs via a convex decomposition

In this paper via the so-called Fenchel–Lagrange duality, we provide necessary local optimality conditions for a reverse convex programming problem ( P ) . As is well known, this duality has been first defined for convex programming problems. So, since in general problem ( P ) is not convex even if...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Rendiconti del Circolo matematico di Palermo Ročník 72; číslo 8; s. 3917 - 3930
Hlavní autoři: Keraoui, Houda, Fatajou, Samir, Aboussoror, Abdelmalek
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.12.2023
Témata:
Algebra
Analysis
Applications of Mathematics
Geometry
Mathematics
Mathematics and Statistics
90C26
Conjugate duality
90C46
Reverse convex programs
90C25
Convex analysis
ISSN:0009-725X, 1973-4409
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper via the so-called Fenchel–Lagrange duality, we provide necessary local optimality conditions for a reverse convex programming problem ( P ) . As is well known, this duality has been first defined for convex programming problems. So, since in general problem ( P ) is not convex even if the data is, we first proceed to a decomposition of an equivalent problem of ( P ) into a family of convex minimization subproblems. Then, by means of the decomposition and the Fenchel–Lagrange duality applied to the subproblems we provide necessary local optimality conditions for the initial problem  ( P ) .
ISSN:0009-725X
1973-4409
DOI:10.1007/s12215-023-00876-6