Duality for minimization of the difference of two \(\Phi_c\)-convex functions
From MaRDI portal
Publication:2691432
DOI10.3934/jimo.2022161OpenAlexW4293104699MaRDI QIDQ2691432
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022161
Lagrange dualityFenchel dualityevenly quasiconvex functions\(\Phi_c\)-convex functions\(c\)-conjugacy
Axiomatic and generalized convexity (52A01) Duality theory (optimization) (49N15) Conjugate functions, conjugate series, singular integrals (42A50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook of generalized convexity and generalized monotonicity
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Duality for quasiconvex minimization over closed convex cones
- Even convexity and optimization. Handling strict inequalities
- Minimizing the difference of two quasiconvex functions
- The stable duality of DC programs for composite convex functions
- Qualification and optimality conditions for dc programs with infinite constraints
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- Conjugacy in quasi-convex programming
- A closedness condition and its applications to DC programs with convex constraints
- Some characterizations of duality for DC optimization with composite functions
- What is quasiconvex analysis?
- Optimality conditions and total dualities for conic programming involving composite function
- Convex Analysis
- On Quasi-Convex Duality
- Abstract convexity and global optimization
This page was built for publication: Duality for minimization of the difference of two \(\Phi_c\)-convex functions