Bregman proximal point type algorithms for quasiconvex minimization
From MaRDI portal
Publication:6192077
DOI10.1080/02331934.2022.2112580OpenAlexW4293825986MaRDI QIDQ6192077
Felipe Lara, Raul T. Marcavillaca
Publication date: 11 March 2024
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2022.2112580
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proximal method for solving quasi-variational inequalities
- 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
- Generalized convexity and optimization. Theory and applications
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Strong convexity of sets and functions
- Proximal point methods and nonconvex optimization
- Proximal minimization algorithm with \(D\)-functions
- A note on strongly convex and quasiconvex functions
- A simplified view of first order methods for optimization
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds
- A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods
- Solving mixed variational inequalities beyond convexity
- On strongly quasiconvex functions: existence results and proximal point algorithms
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A proximal point algorithm with a ϕ-divergence for quasiconvex 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 the proximal point method for equilibrium problems in Hilbert spaces
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Monotone Operators and the Proximal Point Algorithm
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Bregman Monotone Optimization Algorithms
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- An inexact algorithm with proximal distances for variational inequalities
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization
- Proximal Methods in Vector Optimization
- Generalized Convexity, Generalized Monotonicity and Nonsmooth Analysis
- Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Bregman proximal point type algorithms for quasiconvex minimization
