Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
From MaRDI portal
Publication:1750686
DOI10.11650/tjm/7256zbMath1391.90497OpenAlexW2601465491MaRDI QIDQ1750686
Publication date: 23 May 2018
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.twjm/1498750963
Nonconvex programming, global optimization (90C26) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Optimality conditions and constraint qualifications for quasiconvex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- Sandwich theorem for quasiconvex functions and its applications
- 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
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
- Set containment characterization with strict and weak quasiconvex inequalities
- Set containment characterization for quasiconvex programming
- Reverse convex programming
- Generalized concavity
- Some further duality theorems for optimization problems with reverse convex constraint sets
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Set containment characterization
- Optimality conditions for DC programming problems with reverse convex constraints
- Some constraint qualifications for quasiconvex vector-valued systems
- Projective dualities for quasiconvex problems
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Surrogate duality for robust optimization
- Nonlinear error bounds for quasiconvex inequality systems
- The strong conical hull intersection property for convex programming
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Quasiconvex duality theory by generalized conjugation methods
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Lagrangian duality theorems for reverse convex infimization
- On Quasi-Convex Duality
- Inner approximation method for a reverse convex programming problem
This page was built for publication: Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
