Strong subdifferentials: theory and applications in nonconvex optimization
From MaRDI portal
Publication:2079689
DOI10.1007/S10898-022-01149-9OpenAlexW4220970685MaRDI QIDQ2079689FDOQ2079689
Publication date: 30 September 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01149-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- First-Order Methods in Optimization
- Strong and Weak Convexity of Sets and Functions
- Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
- What is quasiconvex analysis?
- Handbook of generalized convexity and generalized monotonicity
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Convex analysis and monotone operator theory in Hilbert spaces
- Generalized convexity and optimization. Theory and applications
- Equivalence among various derivatives and subdifferentials of the distance function.
- Lower subdifferentiable functions and their minimization by cutting planes
- Algorithms for the quasiconvex feasibility problem
- Strong convexity of sets and functions
- Strict lower subdifferentiability and applications
- Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization
- A note on strongly convex and quasiconvex functions
- Generalized convex functions and generalized differentials
- α-Covex Sets and Strong Quasiconvexity
- On global subdifferentials with applications in nonsmooth optimization
- Derivatives with Support and Applications
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Optimality conditions in optimization problems with convex feasible set using convexificators
- On strong quasiconvex functions and boundedness of level sets
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
- On strongly quasiconvex functions: existence results and proximal point algorithms
Cited In (5)
- A subgradient projection method for quasiconvex minimization
- A two-step proximal point algorithm for nonconvex equilibrium problems with applications to fractional programming
- BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity
- Strong Core Theorems with Nonconvex Preferences
- An extragradient projection method for strongly quasiconvex equilibrium problems with applications
This page was built for publication: Strong subdifferentials: theory and applications in nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079689)