An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
DOI10.1080/02331934.2019.1655739zbMath1505.90131OpenAlexW2971105706MaRDI QIDQ5131821
No author found.
Publication date: 9 November 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1655739
necessary and sufficient optimality conditionsconstraint qualificationconvex analysisconjugate dualityFenchel conjugationgeneralized semi-infinite programmingreverse convex problemsDC problemsFenchel-Lagrange dualitydecomposition in convex problems
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- First order optimality conditions for generalized semi-infinite programming problems
- Strong duality for generalized convex optimization problems
- Duality for almost convex optimization problems via the perturbation approach
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- Convex programs with an additional reverse convex constraint
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- Duality in D. C. programming: The case of several D. C. constraints
- On optimality conditions for generalized semi-infinite programming problems
- Generalized semi-infinite programming: Theory and methods
- Optimality conditions for nonsmooth generalized semi-infinite programs
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Generalized semi-infinite programming: numerical aspects
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
- Second order optimality conditions for generalized semi-infinite programming problems
- Convex Analysis
- Second-order optimality conditions in generalized semi-infinite programming
This page was built for publication: An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
