A note on duality in reverse convex optimization
From MaRDI portal
Publication:6648848
DOI10.1080/02331934.2024.2304296MaRDI QIDQ6648848
Publication date: 5 December 2024
Published in: Optimization (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequality systems and optimization
- Convex programs with several additional reverse convex constraints
- Reverse convex programming
- Mathematical programs with a two-dimensional reverse convex constraint
- Some further duality theorems for optimization problems with reverse convex constraint sets
- Duality and regularization for inf-sup problems
- A general duality scheme for nonconvex minimization problems with a strict inequality constraint
- Duality in D. C. programming: The case of several D. C. constraints
- Extremal problems on complements of convex sets
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
- Duality in Reverse Convex Optimization
- Theorems of the Alternative and Duality for INF-SUP Problems
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Lagrangian duality theorems for reverse convex infimization
- Convex analysis and global optimization
- Duality for anticonvex programs.
This page was built for publication: A note on duality in reverse convex optimization
