Strong subdifferentials: theory and applications in nonconvex optimization
From MaRDI portal
Publication:2079689
Recommendations
- Optimality conditions in nonconvex optimization via weak subdifferentials
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- On global subdifferentials with applications in nonsmooth optimization
- KKT optimality conditions in non-smooth, non-convex optimization
- Strict lower subdifferentiability and applications
Cites work
- A note on strongly convex and quasiconvex functions
- Algorithms for the quasiconvex feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces
- Derivatives with Support and Applications
- Equivalence among various derivatives and subdifferentials of the distance function.
- First-order methods in optimization
- Generalized convex functions and generalized differentials
- Generalized convexity and optimization. Theory and applications
- Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Handbook of generalized convexity and generalized monotonicity
- scientific article; zbMATH DE number 3905307 (Why is no real title available?)
- scientific article; zbMATH DE number 3709086 (Why is no real title available?)
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1328977 (Why is no real title available?)
- scientific article; zbMATH DE number 2148567 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- scientific article; zbMATH DE number 3272538 (Why is no real title available?)
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Lower subdifferentiable functions and their minimization by cutting planes
- On global subdifferentials with applications in nonsmooth optimization
- On strong quasiconvex functions and boundedness of level sets
- On strongly quasiconvex functions: existence results and proximal point algorithms
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
- Strict lower subdifferentiability and applications
- Strong and Weak Convexity of Sets and Functions
- Strong convexity of sets and functions
- What is quasiconvex analysis?
- α-Covex Sets and Strong Quasiconvexity
Cited in
(24)- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- On global subdifferentials with applications in nonsmooth optimization
- Q-subdifferential and Q-conjugate for global optimality
- Strong Core Theorems with Nonconvex Preferences
- Strict lower subdifferentiability and applications
- BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity
- On a notion of subdifferentiability for non-convex functions†
- Optimality conditions in nonconvex optimization via weak subdifferentials
- An extragradient projection method for strongly quasiconvex equilibrium problems with applications
- A subgradient projection method for quasiconvex minimization
- A two-step proximal point algorithm for nonconvex equilibrium problems with applications to fractional programming
- A subgradient projection method for quasiconvex multiobjetive optimization
- On the proximal point algorithm for strongly quasiconvex functions in Hadamard spaces
- Rho-subdifferential and its applications to optimization problems
- Some results on -convex functions and Fréchet -subdifferentials
- Characterizations, dynamical systems and gradient methods for strongly quasiconvex functions
- Decomposed quasiconvex optimization with application to generalized cone problems
- Strongly quasiconvex functions: what we know (so far)
- Regular subgradients of marginal functions with applications to calculus and bilevel programming
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- Splitting proximal point algorithms for the sum of prox-convex functions
- On optimality conditions for mathematical programming problems based on strong subdifferentials
- Optimality conditions and duality for multiobjective fractional bilevel optimization problems
- On some dynamical systems involving strongly quasiconvex functions
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)
