On duality for nonconvex minimization problems within the framework of abstract convexity
From MaRDI portal
Publication:5077160
DOI10.1080/02331934.2021.2010076OpenAlexW3202967997MaRDI QIDQ5077160
Monika Syga, Ewa M. Bednarczuk
Publication date: 18 May 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.00611
nonconvex optimizationminimax theoremKarush-Kuhn-Tucker conditionsabstract convexityzero duality gapconjugate dualityLagrangian duality
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- On the \(n\)-coupling problem
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions
- Conjugate duality in convex optimization
- Conjugate functions for convex and nonconvex duality
- Minimax theorems for extended real-valued abstract convex-concave functions
- Maximal abstract monotonicity and generalized Fenchel's conjugation formulas
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Minimax theorems for Ф-convex functions: sufficient and necessary conditions
- Abstract convexity of extended real-valued ICR functions
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- On $\Phi $-Convexity in Extremal Problems
- Minimax Theorems
- Abstract convexity and global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On duality for nonconvex minimization problems within the framework of abstract convexity