An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds
From MaRDI portal
Publication:1955549
DOI10.1007/s10898-012-9996-yzbMath1295.90103MaRDI QIDQ1955549
Publication date: 14 June 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9996-y
quasiconvex functions; convex minimization; Bregman distances; proximal point algorithm; Hadamard manifolds
90C48: Programming in abstract spaces
Related Items
On some basic results related to affine functions on Riemannian manifolds, What do `convexities' imply on Hadamard manifolds?, A multi-step approximant for fixed point problem and convex optimization problem in Hadamard spaces, Rate of convergence for proximal point algorithms on Hadamard manifolds, A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming
- An iterative row-action method for interval convex programming
- Proximal minimization algorithm with \(D\)-functions
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
