A greedy double-block nonlinear Bregman-Kaczmarz method for nonlinear equations
Wendi Bao, Jing Li, Lili Xing, Weiguo Li
Abstract
In this paper, we develop a greedy double-block nonlinear Bregman-Kaczmarz method to efficiently find sparse solutions of nonlinear equations. The theoretical convergence rate of the proposed method is established under certain assumptions. Numerical experiments illustrate the competitive performance and superiority of the proposed method.
Create a lesson
Related papers
Neural Network Preconditioning: A Case Study for the Solution of the Parametric Helmholtz Equation
Luc Giraud, Carola Kruse, Paul Mycek et al.
On the cyclic limiting behavior of the restarted Arnoldi algorithm for real symmetric matrices with restart length s=2
Vance Faber, Jarek Liesen, Jörg Liesen et al.
An algebraic multiscale framework for two-level overlapping Schwarz preconditioners
Filipe Cumaru, Hadi Hajibeygi, Cornelis Vuik et al.
Stable Matrix-Free Q-less QR via Preconditioning and Randomization
Oleg Balabanov, Maksim Melnichenko, Michael W. Mahoney
High-order uniformly accurate fully discrete schemes with long time near-conservations for two nonlinear coupled dispersive models in the nonrelativistic regime
Lina Wang, Jiyong Li, Bin Wang
CLNO: Conservative Local Neural Operator for Compressible Flow Prediction
Buxuan Wang, Rongzu Li, Qingsong Zou