Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
From MaRDI portal
Recommendations
- A simple convergence analysis of Bregman proximal gradient algorithm
- On the linear convergence of a Bregman proximal point algorithm
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- Proximal Minimization Methods with Generalized Bregman Functions
- Convergence of Proximal-Like Algorithms
- Approximate iterations in Bregman-function-based proximal algorithms
- Global convergence of model function based Bregman proximal minimization algorithms
- scientific article; zbMATH DE number 776083
- Convergence of the Bregman extragradient method
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
Cited in
(only showing first 100 items - show all)- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Progressive regularization of variational inequalities and decomposition algorithms
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Approximate iterations in Bregman-function-based proximal algorithms
- Proximal minimization algorithm with \(D\)-functions
- An interior point method for the nonlinear complementarity problem
- Equilibrium programming using proximal-like algorithms
- Generalized Bregman projections in convex feasibility problems
- Subgradient method with entropic projections for convex nondifferentiable minimization
- On some properties of generalized proximal point methods for variational inequalities
- Approximation of linear programs by Bregman's \(D_F\) projections
- A simplified view of first order methods for optimization
- A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic
- Higher order convergence rates for Bregman iterated variational regularization of inverse problems
- Learning in games with continuous action sets and unknown payoff functions
- Applications of Bregman-Opial property to Bregman nonspreading mappings in Banach spaces
- Bregman \(f\)-projection operator with applications to variational inequalities in Banach spaces
- Existence and convergence theorems for Bregman best proximity points in reflexive Banach spaces
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Some properties of generalized proximal point methods for quadratic and linear programming
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Interior point methods for equilibrium problems
- A generalized univariate Newton method motivated by proximal regularization
- An interior proximal method for a class of quasimonotone variational inequalities
- Alternating minimization as sequential unconstrained minimization: a survey
- An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds
- Pseudomonotone operators and the Bregman proximal point algorithm
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Bregman asymptotic pointwise nonexpansive mappings in Banach spaces
- Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization
- The condition number of a function relative to a set
- An enhanced Baillon-Haddad theorem for convex functions defined on convex sets
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems
- An ADMM-based SQP method for separably smooth nonconvex optimization
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
- On Bregman-type distances and their associated projection mappings
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- The developments of proximal point algorithms
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Theoretical aspect of diagonal Bregman proximal methods
- Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings
- Inexact version of Bregman proximal gradient algorithm
- Testing and non-linear preconditioning of the proximal point method
- An adaptive primal-dual framework for nonsmooth convex minimization
- Generalized Bregman envelopes and proximity operators
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
- Existence of common fixed points using Bregman nonexpansive retracts and Bregman functions in Banach spaces
- Algorithms of robust stochastic optimization based on mirror descent method
- The modified second APG method for DC optimization problems
- On a Bregman regularized proximal point method for solving equilibrium problems
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- Weak convergence theorems for Bregman relatively nonexpansive mappings in Banach spaces
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Iterative total variation regularization with non-quadratic fidelity
- Inverse scale spaces for nonlinear regularization
- Proximal gradient methods for multiobjective optimization and their applications
- A simple convergence analysis of Bregman proximal gradient algorithm
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Approximating common fixed points of Bregman weakly relatively nonexpansive mappings in Banach spaces
- On the existence and convergence of approximate solutions for equilibrium problems in Banach spaces
- Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions
- Interior projection-like methods for monotone variational inequalities
- A proximal trust-region algorithm for column generation stabilization
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles
- Hybrid iterative algorithm for finite families of countable Bregman quasi-Lipschitz mappings with applications in Banach spaces
- A penalty algorithm for solving convex separable knapsack problems
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Perturbed Fenchel duality and first-order methods
- Bregman three-operator splitting methods
- Event-triggered distributed online convex optimization with delayed bandit feedback
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- Dykstras algorithm with bregman projections: A convergence proof
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- A proximal point algorithm with a -divergence for quasiconvex programming
- Convergence theorem for equilibrium problem and Bregman strongly nonexpansive mappings in Banach spaces
- A proximal multiplier method for separable convex minimization
- A proximal method with logarithmic barrier for nonlinear complementarity problems
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
- Coordinate descent with arbitrary sampling. I: Algorithms and complexity.
- New hybrid shrinking projection algorithm for common fixed points of a family of countable quasi-Bregman strictly pseudocontractive mappings with equilibrium and variational inequality and optimization problems
- Interior proximal methods for equilibrium programming: part I
- A strong convergence theorem for Bregman asymptotically quasi-nonexpansive mappings in the intermediate sense
- Strong convergence theorems for Bregman \(W\)-mappings with applications to convex feasibility problems in Banach spaces
- Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces
- The Legendre transformation in modern optimization
- Generalized proximal point algorithms for multiobjective optimization problems
- Sparsity regularization of the diffusion coefficient identification problem: well-posedness and convergence rates
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Proximal Methods with Penalization Effects in Banach Spaces
- An inexact proximal method for quasiconvex minimization
- A weighted mirror descent algorithm for nonsmooth convex optimization problem
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
This page was built for publication: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140001)
