On strongly quasiconvex functions: existence results and proximal point algorithms

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?)
First-Order Methods in Optimization
Strong and Weak Convexity of Sets and Functions
Monotone Operators and the Proximal Point Algorithm
A proximal method for composite minimization
Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
Inexact Variants of the Proximal Point Algorithm without Monotonicity
Proximal Methods for Cohypomonotone Operators
Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
Computing proximal points of nonconvex functions
An optimal algorithm for stochastic strongly-convex optimization
Convex analysis and monotone operator theory in Hilbert spaces
Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
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
Strictly quasi-convex (concave) functions and duality in mathematical programming
Pseudo-Convex Functions
Convergence and efficiency of subgradient methods for quasiconvex minimization
On lower and upper bounds in smooth and strongly convex optimization
Strong convexity of sets and functions
A note on strongly convex and quasiconvex functions
A subgradient method for multiobjective optimization
Accelerating the DC algorithm for smooth functions
α-Covex Sets and Strong Quasiconvexity
An extension of the proximal point algorithm beyond convexity
Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions
Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
On strong quasiconvex functions and boundedness of level sets

Cited In (12)

Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems
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
An extragradient projection method for strongly quasiconvex equilibrium problems with applications
Strong subdifferentials: theory and applications in nonconvex optimization
Relaxed-inertial proximal point type algorithms for quasiconvex minimization

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)