Semistrictly and neatly quasiconvex programming using lower global subdifferentials

DOI10.1007/S10898-023-01278-9MaRDI QIDQ6164018zbMATH OpenOpenAlexFDO

Authors Alireza Kabgani, Felipe Lara

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

zbMATH Keywords

global subdifferentialsGreenberg-Pierskalla's subdifferentialKKT conditionsnonconvex optimizationquasiconvex programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Strict lower subdifferentiability and applications
• On global subdifferentials with applications in nonsmooth optimization
• Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
• scientific article; zbMATH DE number 7476164
• An appropriate subdifferential for quasiconvex functions

Cites work

• An appropriate subdifferential for quasiconvex functions
• An extension of the proximal point algorithm beyond convexity
• Approximation of quasiconvex functions by neatly quasiconvex functions
• Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion
• Characterization of solution sets of quasiconvex programs
• Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
• Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization
• Constraint qualifications and optimality conditions in nonsmooth locally star-shaped optimization using convexificators
• Convex Analysis
• Convexifactors, generalized convexity, and optimality conditions
• Disciplined quasiconvex programming
• Fixed point quasiconvex subgradient method
• Generalized Concavity
• Generalized convexity and optimization. Theory and applications
• Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• scientific article; zbMATH DE number 3435272 (Why is no real title available?)
• scientific article; zbMATH DE number 3336546 (Why is no real title available?)
• scientific article; zbMATH DE number 2226571 (Why is no real title available?)
• Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
• Nonlinear Programming
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• On global subdifferentials with applications in nonsmooth optimization
• On the equality of Clarke and Greenberg-Pierskalla differentials
• Optimality conditions for nonconvex nonsmooth optimization via global derivatives
• Relationships between convexificators and Greenberg-Pierskalla subdifferentials for quasiconvex functions
• Strictly quasi-convex (concave) functions and duality in mathematical programming
• Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
• The q-asymptotic function in c-convex analysis
• Transformation of quasiconvex functions to eliminate local minima
• What is quasiconvex analysis?

Cited in

(2)

• Adjusted Sublevel Sets, Normal Operator, and Quasi-convex Programming
• Approximate optimality conditions for nonsmooth optimization problems

This page was built for publication: Semistrictly and neatly quasiconvex programming using lower global subdifferentials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164018)