Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
From MaRDI portal
Publication:5110313
DOI10.1080/02331934.2019.1672166zbMath1477.90069OpenAlexW2980084187MaRDI QIDQ5110313
Nazih Abderrazzak Gadhi, Stephan Dempe, Khadija Hamdaoui
Publication date: 18 May 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1672166
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions (49K99)
Cites Work
- Unnamed Item
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- On set containment characterization and constraint qualification for quasiconvex programming
- Subdifferential calculus for a quasiconvex function with generator
- Advanced analysis on the real line
- Some constraint qualifications for quasiconvex vector-valued systems
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- A characterization of quasiconvex vector-valued functions
- On Quasi-Convex Duality
This page was built for publication: Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system