On strongly quasiconvex functions: existence results and proximal point algorithms
From MaRDI portal
(Redirected from Publication:2116608)
Recommendations
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems
- Interior proximal methods for quasiconvex optimization
- A proximal point algorithm with a \(\varphi \)-divergence for quasiconvex programming
- An inexact proximal method for quasiconvex minimization
Cites work
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 3964254 (Why is no real title available?)
- scientific article; zbMATH DE number 3709086 (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?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- A note on strongly convex and quasiconvex functions
- A proximal method for composite minimization
- A subgradient method for multiobjective optimization
- Accelerating the DC algorithm for smooth functions
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- An extension of the proximal point algorithm beyond convexity
- An inexact proximal method for quasiconvex minimization
- Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
- Computing proximal points of nonconvex functions
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- First-order methods in optimization
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Interior proximal methods for quasiconvex optimization
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Monotone Operators and the Proximal Point Algorithm
- On lower and upper bounds in smooth and strongly convex optimization
- On strong quasiconvex functions and boundedness of level sets
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Proximal Methods for Cohypomonotone Operators
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Pseudo-Convex Functions
- Robust accelerated gradient methods for smooth strongly convex functions
- Strictly quasi-convex (concave) functions and duality in mathematical programming
- Strong and Weak Convexity of Sets and Functions
- Strong convexity of sets and functions
- α-Covex Sets and Strong Quasiconvexity
Cited in
(13)- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems
- An extension of the proximal point algorithm beyond convexity
- Proximal point method for quasiconvex functions in Riemannian manifolds
- Bregman proximal point type algorithms for quasiconvex minimization
- A subgradient projection method for quasiconvex minimization
- A two-step proximal point algorithm for nonconvex equilibrium problems with applications to fractional programming
- Proximal point type algorithms with relaxed and inertial effects beyond convexity
- Finite convergence and sharp minima for quasi-equilibrium problems
- Relaxed-inertial proximal point algorithms for nonconvex equilibrium problems with applications
- Self-adaptive extragradient algorithms for quasi-equilibrium problems
- Strong subdifferentials: theory and applications in nonconvex optimization
- An extragradient projection method for strongly quasiconvex equilibrium problems with applications
This page was built for publication: On strongly quasiconvex functions: existence results and proximal point algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116608)
