Related papers: Local convergence analysis of Newton's method for …
We study a perturbative scheme for normalization problems involving resonances of the unperturbed situation, and therefore the necessity of a non-trivial normal form, in the general framework of Banach scale Lie algebras (this notion is…
In this paper the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem. This fact, under a suitable condition, leads to an…
In this paper, we propose a first second-order scheme based on arbitrary non-Euclidean norms, incorporated by Bregman distances. They are introduced directly in the Newton iterate with regularization parameter proportional to the square…
Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their…
In this paper, we study the generalized Douglas-Rachford algorithm and its cyclic variants which include many projection-type methods such as the classical Douglas-Rachford algorithm and the alternating projection algorithm. Specifically,…
We propose a regularized Hessian-free Newton-type method for minimizing smooth convex functions with Lipschitz continuous Hessians. The algorithm constructs an approximate Hessian by finite differences and selects the regularization…
In this paper, the local convergence of Iteratively regularized Landweber iteration method is investigated for solving non-linear inverse problems in Banach spaces. Our analysis mainly relies on the assumption that the inverse mapping…
In this work we develop and analyze a semi-smooth Newton method for the general nonlinear conic programming problem. In particular, we study the problem with a generalized simplicial cone, i.e., the image of a symmetric cone under a linear…
A convergence analysis is developed for the regularized Newton method for training neural networks (NNs) in the overparameterized limit. As the number of hidden units tends to infinity, the NN training dynamics converge in probability to…
In this article, we develop an algorithm suitable for constrained optimization in $\mathbb{R}^n$. The results are developed through standard tools of n-dimensional real analysis and basic concepts of optimization. Indeed, the well known…
In this paper we consider variational regularization methods for inverse problems with large noise that is in general unbounded in the image space of the forward operator. We introduce a Banach space setting that allows to define a…
In this paper, we propose a quantized learning equation with a monotone increasing resolution of quantization and stochastic analysis for the proposed algorithm. According to the white noise hypothesis for the quantization error with dense…
The Newton method is a powerful optimization algorithm, valued for its rapid local convergence and elegant geometric properties. However, its theoretical guarantees are usually limited to convex problems. In this work, we ask whether…
This work presents a comprehensive discretization theory for abstract linear operator equations in Banach spaces. The fundamental starting point of the theory is the idea of residual minimization in dual norms, and its inexact version using…
We can obtain one solution of the Hamiltonian constraint equation in the local sense. The form of the state is suggested from the up-to-down method in our previous work. The up-to-down method works for different way in treating the general…
Stochastic evolution equations in Banach spaces with unbounded nonlinear drift and diffusion operators driven by a finite dimensional Brownian motion are considered. Under some regularity condition assumed for the solution, the rate of…
Alternative iterative methods for a nonexpansive mapping in a Banach space are proposed and proved to be convergent to a common solution to a fixed point problem and a variational inequality. We give rates of asymptotic regularity for such…
We present a general framework, treating Lipschitz domains in Riemannian manifolds, that provides conditions guaranteeing the existence of norming sets and generalized local polynomial reproduction - a powerful tool used in the analysis of…
The Generalized Locally Toeplitz (GLT) sequences of matrices have been originated from the study of certain partial differential equations. To be more precise, such matrix sequences arise when we numerically approximate some partial…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…