Pages that link to "Item:Q3140001"
From MaRDI portal
The following pages link to Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions (Q3140001):
Displaying 41 items.
- On the linear convergence of a Bregman proximal point algorithm (Q5088831) (← links)
- Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
- (Q5113130) (← links)
- The Generalized Bregman Distance (Q5147034) (← links)
- Second-Order Dynamics with Hessian-Driven Damping for Linearly Constrained Convex Minimization (Q5158373) (← links)
- 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 (Q5225341) (← links)
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)
- Bregman best proximity points for Bregman asymptotic cyclic contraction mappings in Banach spaces (Q5244129) (← links)
- Optimal Affine-Invariant Smooth Minimization Algorithms (Q5376450) (← links)
- An introduction to continuous optimization for imaging (Q5740077) (← links)
- Interior Proximal Methods for equilibrium programming: part II (Q5746733) (← links)
- Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)
- On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) (← links)
- On inexact solution of auxiliary problems in tensor methods for convex optimization (Q5859013) (← links)
- Inexact model: a framework for optimization and variational inequalities (Q5865338) (← links)
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems (Q5885824) (← links)
- Unifying mirror descent and dual averaging (Q6038659) (← links)
- Transformed primal-dual methods for nonlinear saddle point systems (Q6087387) (← links)
- A stochastic variance reduction algorithm with Bregman distances for structured composite problems (Q6106321) (← links)
- Stochastic composition optimization of functions without Lipschitz continuous gradient (Q6108982) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)
- Optimal Algorithms for Stochastic Complementary Composite Minimization (Q6136660) (← links)
- Bregman-Golden ratio algorithms for variational inequalities (Q6145051) (← links)
- Nonstationary online convex optimization with multiple predictions (Q6151925) (← links)
- The method of randomized Bregman projections for stochastic feasibility problems (Q6156125) (← links)
- Provable Phase Retrieval with Mirror Descent (Q6168333) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling (Q6173532) (← links)
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems (Q6561482) (← links)
- The rate of convergence of Bregman proximal methods: local geometry versus regularity versus sharpness (Q6573018) (← links)
- On the Bregman-proximal iterative algorithm for the monotone inclusion problem in Banach spaces (Q6593317) (← links)
- Bregman methods for large-scale optimization with applications in imaging (Q6606442) (← links)
- Strong convergence theorem of Bregman algorithm for solving variational inequalities in Banach spaces (Q6608164) (← links)
- Nonsmooth projection-free optimization with functional constraints (Q6642795) (← links)
- A mirror inertial forward-reflected-backward splitting: convergence analysis beyond convexity and Lipschitz smoothness (Q6644234) (← links)
- Theory and fast learned solver for \(\ell^1\)-TV regularization (Q6659670) (← links)
- Stochastic optimization over proximally smooth sets (Q6663114) (← links)
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization (Q6664932) (← links)
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation (Q6668156) (← links)
