Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
From MaRDI portal
Publication:2022228
DOI10.1007/s10898-020-00926-8zbMath1475.90131OpenAlexW3044808105MaRDI QIDQ2022228
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00926-8
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions of several variables, generalizations (26B25)
Related Items (4)
Characterizations of the solution set for tangentially convex optimization problems ⋮ Semistrictly and neatly quasiconvex programming using lower global subdifferentials ⋮ Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion ⋮ Strong subdifferentials: theory and applications in nonconvex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- 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
- Generalized convexity and optimization. Theory and applications
- A simple characterization of solutions sets of convex programs
- Generalized concavity
- Characterization of solution sets of quasiconvex programs
- Transformation of quasiconvex functions to eliminate local minima
- Characterizations of the solution set for non-essentially quasiconvex programming
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Set containment characterization
- Some constraint qualifications for quasiconvex vector-valued systems
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Optimality conditions and constraint qualifications for quasiconvex programming
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality theorems for separable convex programming without qualifications
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Inexact subgradient methods for quasi-convex optimization problems
- An Appropriate Subdifferential for Quasiconvex Functions
- Optimality Conditions for Quasiconvex Programs
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Quasiconvex duality theory by generalized conjugation methods
- Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
- What is quasiconvex analysis?
- On Quasi-Convex Duality
This page was built for publication: Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
