A Bregman–Kaczmarz method for nonlinear systems of equations

DOI10.1007/S10589-023-00541-9MaRDI QIDQ6492445

Dirk A. Lorenz, Robert M. Gower, Maximilian Winkler

Publication date: 25 April 2024

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Newton-type methods (49M15) Methods of quasi-Newton type (90C53) Complexity and performance of numerical algorithms (65Y20) Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random algorithms for convex minimization problems
• An O(n) algorithm for quadratic knapsack problems
• An iterative row-action method for interval convex programming
• Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
• Linear convergence of the randomized sparse Kaczmarz method
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• Nonlinear Kaczmarz algorithms and their convergence
• Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
• Sparse solutions of optimal control via Newton method for under-determined systems
• An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty
• Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
• Cubic regularization of Newton method and its global performance
• Landweber-Kaczmarz method in Banach spaces with inexact inner solvers
• An iterative regularization method for nonlinear problems based on Bregman projections
• Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
• The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
• Iterative regularization with a general penalty term—theory and application to L ¹ and TV regularization
• Two-Metric Projection Methods for Constrained Optimization
• Nonlinear iterative methods for linear ill-posed problems in Banach spaces
• Matrix Nearness Problems with Bregman Divergences
• An iterative algorithm for signal reconstruction from bispectrum
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
• Newton-type Methods with Generalized Distances For Constrained Optimization
• Iterating Bregman Retractions
• Bregman Monotone Optimization Algorithms
• First-Order Methods in Optimization
• Re-examination of Bregman functions and new properties of their divergences
• Refinements of Pinsker's inequality
• Sketched Newton--Raphson
• Iterative Bregman Projections for Regularized Transportation Problems
• Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
• Convex Analysis
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• New versions of Newton method: step-size choice, convergence domain and under-determined equations
• Convex analysis and monotone operator theory in Hilbert spaces
• Stochastic mirror descent method for linear ill-posed problems in Banach spaces

This page was built for publication: A Bregman–Kaczmarz method for nonlinear systems of equations