An extension of the proximal point algorithm beyond convexity
From MaRDI portal
Publication:2114582
DOI10.1007/s10898-021-01081-4OpenAlexW3197597131MaRDI QIDQ2114582
Publication date: 15 March 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.08822
nonsmooth optimizationnonconvex optimizationproximal point algorithmproximity operatorgeneralized convex function
Related Items (6)
Two-step inertial forward-reflected-backward splitting based algorithm for nonconvex mixed variational inequalities ⋮ Extension of forward-reflected-backward method to non-convex mixed variational inequalities ⋮ Proximal subgradient algorithm for a class of nonconvex bilevel equilibrium problems ⋮ Semistrictly and neatly quasiconvex programming using lower global subdifferentials ⋮ Relaxed-inertial proximal point type algorithms for quasiconvex minimization ⋮ On strongly quasiconvex functions: existence results and proximal point algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proximal method for composite minimization
- An inexact proximal method for quasiconvex minimization
- Interior proximal methods for quasiconvex optimization
- Handbook of generalized convexity and generalized monotonicity
- Global optimization from concave minimization to concave mixed variational inequality
- Lower subdifferentiable functions and their minimization by cutting planes
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Generalized convexity and optimization. Theory and applications
- Computing proximal points of nonconvex functions
- Strong convexity of sets and functions
- Transformation of quasiconvex functions to eliminate local minima
- Accelerating the DC algorithm for smooth functions
- A regularization interpretation of the proximal point method for weakly convex functions
- A characterization of proximity operators
- A general double-proximal gradient algorithm for d.c. programming
- Algorithms for the quasiconvex feasibility problem
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming
- Strong and Weak Convexity of Sets and Functions
- Strict lower subdifferentiability and applications
- α-Covex Sets and Strong Quasiconvexity
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Proximal Methods for Cohypomonotone Operators
- What is quasiconvex analysis?
- On a decomposition formula for the proximal operator of the sum of two convex functions
- Proximal-gradient algorithms for fractional programming
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: An extension of the proximal point algorithm beyond convexity
