Bregman Monotone Optimization Algorithms
DOI10.1137/S0363012902407120zbMATH Open1049.90053DBLPjournals/siamco/BauschkeBC03WikidataQ56935742 ScholiaQ56935742MaRDI QIDQ4442998FDOQ4442998
Heinz H. Bauschke, Patrick L. Combettes, Jonathan M. Borwein
Publication date: 8 January 2004
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Recommendations
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Variable quasi-Bregman monotone sequences
- Bregman forward-backward operator splitting
- Joint and separate convexity of the Bregman distance.
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
Banach spaceBregman projectionresolventBregman distanceLegendre functionproximal point algorithmconvex feasibility problemmonotone operatorsubgradient projectionproximal mappingessentially smooth functionBregman monotone\({\mathfrak B}\)-class operatorblock-iterative methodessentially strict convex functionFejér monotone
Convex programming (90C25) Monotone operators and generalizations (47H05) Programming in abstract spaces (90C48)
Cited In (only showing first 100 items - show all)
- Strong convergence results of two-steps modifying Halpern's iteration for Bregman strongly nonexpansive multi-valued mappings in reflexive Banach spaces with application
- A modified Halpern algorithm for approximating a common solution of split equality convex minimization problem and fixed point problem in uniformly convex Banach spaces
- Convergence results for a common solution of a finite family of variational inequality problems for monotone mappings with Bregman distance function
- Forward-backward splitting with Bregman distances
- Halpern-Mann's iterations for Bregman strongly nonexpansive mappings in reflexive Banach spaces with applications
- Algorithms for stochastic optimization with function or expectation constraints
- Right Bregman nonexpansive operators in Banach spaces
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- An optimal method for stochastic composite optimization
- Construction of best Bregman approximations in reflexive Banach spaces
- Halpern's iteration for Bregman strongly nonexpansive mappings in reflexive Banach spaces
- Convergence theorems for maximal monotone operators and fixed point problems in Banach spaces
- Subgradient projectors: extensions, theory, and characterizations
- First-order methods for convex optimization
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
- The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- The general split equality problem for Bregman quasi-nonexpansive mappings in Banach spaces
- Strong convergence of hybrid Halpern iteration for Bregman totally quasi-asymptotically nonexpansive multi-valued mappings in reflexive Banach spaces with application
- Strong convergence theorems for Bregman \(W\)-mappings with applications to convex feasibility problems in Banach spaces
- An iterative method for solving minimization, variational inequality and fixed point problems in reflexive Banach spaces
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- The information geometry of Bregman divergences and some applications in multi-expert reasoning
- Parallel hybrid algorithm for solving pseudomonotone equilibrium and split common fixed point problems
- Minimization of Tikhonov functionals in Banach spaces
- An optimal randomized incremental gradient method
- A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors
- Joint and separate convexity of the Bregman distance.
- Gradient sliding for composite optimization
- A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings
- Re-examination of Bregman functions and new properties of their divergences
- Regularization in Banach spaces with respect to the Bregman distance
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors
- Halpern's iteration for Bregman strongly nonexpansive multi-valued mappings in reflexive Banach spaces with application
- Inexact proximal point methods in metric spaces
- Composite iterative schemes for maximal monotone operators in reflexive Banach spaces
- Bregman weak relatively nonexpansive mappings in Banach spaces
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- A simple nearly optimal restart scheme for speeding up first-order methods
- Existence and Approximation of Fixed Points of Bregman Firmly Nonexpansive Mappings in Reflexive Banach Spaces
- Existence and Approximation of Fixed Points of Right Bregman Nonexpansive Operators
- Bregman distances and Chebyshev sets
- Strong convergence theorems for equilibrium problems and weak Bregman relatively nonexpansive mappings in Banach spaces
- Bregman distance and strong convergence of proximal-type algorithms
- Approximation of fixed points of weak Bregman relatively nonexpansive mappings in Banach spaces
- Two projection algorithms for solving the split common fixed point problem
- Iterative solution of split variational inclusion problem in a real Banach spaces
- Moreau's decomposition in Banach spaces
- Convergence theorem for equilibrium problem and Bregman strongly nonexpansive mappings in Banach spaces
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- A Halpern-type iteration method for Bregman nonspreading mapping and monotone operators in reflexive Banach spaces
- A strong convergence theorem for Bregman quasi-noexpansive mappings with applications
- Convergence rates of gradient methods for convex optimization in the space of measures
- Strong convergence theorems for quasi-Bregman nonexpansive mappings in reflexive Banach spaces
- Weak convergence theorems for Bregman relatively nonexpansive mappings in Banach spaces
- Convergence theorems for equilibrium and fixed point problems
- Halpern-type iterations for strongly relatively nonexpansive mappings in Banach spaces
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions
- Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
- Degenerate Preconditioned Proximal Point Algorithms
- Sampling from non-smooth distributions through Langevin diffusion
- Variable quasi-Bregman monotone sequences
- The Moreau envelope function and proximal mapping in the sense of the Bregman distance
- Strong convergence of two algorithms for the split feasibility problem in Banach spaces
- Linear convergence of iterative soft-thresholding
- A projection method for solving nonlinear problems in reflexive Banach spaces
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- Nonlinear iterative methods for solving the split common null point problem in Banach spaces
- Strong convergence of a generalized forward–backward splitting method in reflexive Banach spaces
- Bregman forward-backward operator splitting
- Approximation of common solutions for system of equilibrium problems and fixed-point problems
- On generalized Bregman nonspreading mappings and zero points of maximal monotone operator in a reflexive Banach space
- A characterization of proximity operators
- Random Gradient Extrapolation for Distributed and Stochastic Optimization
- The method of randomized Bregman projections for stochastic feasibility problems
- Convergence theorems for right Bregman strongly nonexpansive mappings in reflexive Banach spaces
- Discounted dynamic optimization and Bregman divergence
- Matrix-Monotonic Optimization $-$ Part I: Single-Variable Optimization
- Strong convergence of Halpern iteration for products of finitely many resolvents of maximal monotone operators in Banach spaces
- A hybrid extragradient method for solving pseudomonotone equilibrium problems using Bregman distance
- A new multi-step iterative algorithm for approximating common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings
- Second-Order Dynamics with Hessian-Driven Damping for Linearly Constrained Convex Minimization
- Existence of common fixed points using Bregman nonexpansive retracts and Bregman functions in Banach spaces
- On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints
- Two strong convergence theorems for the common null point problem in Banach spaces
- The modified Ishikawa iterative algorithm with errors for a countable family of Bregman totally quasi-\(D\)-asymptotically nonexpansive mappings in reflexive Banach spaces
- An iterative explicit algorithm for solving equilibrium problems in Banach spaces
- Title not available (Why is that?)
- On the generalized Bregman projection operator in reflexive Banach spaces
- The geometry of monotone operator splitting methods
- Point process estimation with Mirror Prox algorithms
- Title not available (Why is that?)
- A new algorithm for finding fixed points of Bregman quasi-nonexpansive mappings and zeros of maximal monotone operators by using products of resolvents
- Inertial Halpern-type methods for variational inequality with application to medical image recovery
- Bregman methods for large-scale optimization with applications in imaging
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- An inertial S-iteration process for a common fixed point of a family of quasi-Bregman nonexpansive mappings
- Resolvent and proximal compositions
- Inertial-type algorithm for solving split common fixed point problems in Banach spaces
This page was built for publication: Bregman Monotone Optimization Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4442998)