Semistrictly and neatly quasiconvex programming using lower global subdifferentials
From MaRDI portal
Publication:6164018
DOI10.1007/s10898-023-01278-9OpenAlexW4322201943MaRDI QIDQ6164018
Publication date: 26 July 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-023-01278-9
nonconvex optimizationKKT conditionsquasiconvex programmingglobal subdifferentialsGreenberg-Pierskalla's subdifferential
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexifactors, generalized convexity, and optimality conditions
- Approximation of quasiconvex functions by neatly quasiconvex functions
- Generalized convexity and optimization. Theory and applications
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Characterization of solution sets of quasiconvex programs
- Transformation of quasiconvex functions to eliminate local minima
- Optimality conditions for nonconvex nonsmooth optimization via global derivatives
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion
- On global subdifferentials with applications in nonsmooth optimization
- An extension of the proximal point algorithm beyond convexity
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- Disciplined quasiconvex programming
- Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization
- Fixed point quasiconvex subgradient method
- Strictly quasi-convex (concave) functions and duality in mathematical programming
- An Appropriate Subdifferential for Quasiconvex Functions
- Generalized Convexity, Nonsmooth Variational Inequalities, and Nonsmooth Optimization
- Generalized Concavity
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
- Relationships Between Convexificators and Greenberg–Pierskalla Subdifferentials for Quasiconvex Functions
- What is quasiconvex analysis?
- The q-asymptotic function in c-convex analysis
- Nonlinear Programming
- Convex Analysis
This page was built for publication: Semistrictly and neatly quasiconvex programming using lower global subdifferentials