On strongly quasiconvex functions: existence results and proximal point algorithms
From MaRDI portal
Publication:2116608
DOI10.1007/s10957-021-01996-8zbMath1492.90137OpenAlexW4213093246MaRDI QIDQ2116608
Publication date: 18 March 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01996-8
nonsmooth optimizationexistence of solutionsnonconvex optimizationproximal point algorithmsstrongly quasiconvex functions
Related Items
Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems ⋮ Relaxed-inertial proximal point type algorithms for quasiconvex minimization ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ 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
- A proximal method for composite minimization
- An inexact proximal method for quasiconvex minimization
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Interior proximal methods for quasiconvex optimization
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Computing proximal points of nonconvex functions
- Strong convexity of sets and functions
- A note on strongly convex and quasiconvex functions
- Accelerating the DC algorithm for smooth functions
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- An extension of the proximal point algorithm beyond convexity
- A subgradient method for multiobjective optimization
- Strictly quasi-convex (concave) functions and duality in mathematical programming
- On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems
- An optimal algorithm for stochastic strongly-convex optimization
- Strong and Weak Convexity of Sets and Functions
- On strong quasiconvex functions and boundedness of level sets
- Monotone Operators and the Proximal Point Algorithm
- α-Covex Sets and Strong Quasiconvexity
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- First-Order Methods in Optimization
- Proximal Methods for Cohypomonotone Operators
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
- Pseudo-Convex Functions
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions
- Convex analysis and monotone operator theory in Hilbert spaces
- Convergence and efficiency of subgradient methods for quasiconvex minimization
