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)- On the nature of Bregman functions
- Optimal convergence rate for mirror descent methods with special time-varying step sizes rules
- Unifying mirror descent and dual averaging
- Interior proximal extragradient method for equilibrium problems
- On the convergence of Newton-type proximal gradient method for multiobjective optimization problems
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Applications of Bregman-Opial property to Bregman nonspreading mappings in Banach spaces
- Bregman \(f\)-projection operator with applications to variational inequalities in Banach spaces
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- 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
- Broadcast-based asynchronous convex optimization using quantized distributed stochastic mirror descent algorithm
- Convergence of a proximal-like algorithm in the presence of computational errors
- A strong convergence theorem for Bregman asymptotically quasi-nonexpansive mappings in the intermediate sense
- The method of randomized Bregman projections for stochastic feasibility problems
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Optimal Algorithms for Stochastic Complementary Composite Minimization
- Iterative total variation regularization with non-quadratic fidelity
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- A novel nonconvex penalty method for a rank constrained matrix optimization problem and its applications
- A proximal trust-region algorithm for column generation stabilization
- Generalized Bregman envelopes and proximity operators
- A derivative-free comirror algorithm for convex optimization
- Inexact model: a framework for optimization and variational inequalities
- A unified primal-dual algorithm framework based on Bregman iteration
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- On the convergence of the exponential multiplier method for convex programming
- Bregman three-operator splitting methods
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Analysis of the SIMPL method for density-based topology optimization
- Proximal gradient methods for multiobjective optimization and their applications
- Strong convergence of Halpern iteration for products of finitely many resolvents of maximal monotone operators in Banach spaces
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Dykstras algorithm with bregman projections: A convergence proof
- Klee sets and Chebyshev centers for the right Bregman distance
- The rate of convergence of Bregman proximal methods: local geometry versus regularity versus sharpness
- Nonconvex stochastic Bregman proximal gradient method with application to deep learning
- Existence of common fixed points using Bregman nonexpansive retracts and Bregman functions in Banach spaces
- Nonstationary online convex optimization with multiple predictions
- Mirror descent methods with a weighting scheme for outputs for optimization problems with functional constraints
- A proximal method with logarithmic barrier for nonlinear complementarity problems
- scientific article; zbMATH DE number 776083 (Why is no real title available?)
- Algorithms of robust stochastic optimization based on mirror descent method
- First-order methods for convex optimization
- A penalty algorithm for solving convex separable knapsack problems
- On a proximal point method for convex optimization in banach spaces
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- Existence and convergence theorems for Bregman best proximity points in reflexive Banach spaces
- Optimal Affine-Invariant Smooth Minimization Algorithms
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Nonmonotone proximal gradient method for composite multiobjective optimization problems
- Coordinate descent with arbitrary sampling. I: Algorithms and complexity.
- An ADMM-based SQP method for separably smooth nonconvex optimization
- Market Equilibria and Risk Diversification in Blockchain Mining Economies
- Learning in games with continuous action sets and unknown payoff functions
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- 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
- Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces
- Strong convergence theorems for Bregman \(W\)-mappings with applications to convex feasibility problems in Banach spaces
- A proximal multiplier method for separable convex minimization
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- Alternating minimization as sequential unconstrained minimization: a survey
- Approximate iterations in Bregman-function-based proximal algorithms
- Accelerated hybrid iterative algorithm for common fixed points of a finite families of countable Bregman quasi-Lipschitz mappings and solutions of generalized equilibrium problem with application
- Inverse scale spaces for nonlinear regularization
- Bregman asymptotic pointwise nonexpansive mappings in Banach spaces
- A generalized univariate Newton method motivated by proximal regularization
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- Interior Proximal Methods for equilibrium programming: part II
- Progressive regularization of variational inequalities and decomposition algorithms
- On the convergence of gradient-like flows with noisy gradient input
- Interior proximal methods and central paths for convex second-order cone programming
- Regularizing with Bregman-Moreau envelopes
- Proximal methods in reflexive Banach spaces without monotonicity
- Interior point methods for equilibrium problems
- An interior proximal method in vector optimization
- On the Bregman-proximal iterative algorithm for the monotone inclusion problem in Banach spaces
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- Interior projection-like methods for monotone variational inequalities
- scientific article; zbMATH DE number 1968261 (Why is no real title available?)
- Provable Phase Retrieval with Mirror Descent
- Convergence of a proximal point algorithm for solving minimization problems
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Equilibrium programming using proximal-like algorithms
- An adaptive primal-dual framework for nonsmooth convex minimization
- A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling
- An interior proximal method for a class of quasimonotone variational inequalities
- 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
- Bregman methods for large-scale optimization with applications in imaging
- Strong convergence theorem of Bregman algorithm for solving variational inequalities in Banach spaces
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)
