Related papers: Local convergence analysis of Newton's method for …
This book is devoted to finite-dimensional problems of non-convex non-smooth optimization and numerical methods for their solution. The problem of nonconvexity is studied in the book on two main models of nonconvex dependencies: these are…
In this paper, a globally convergent Newton-type proximal gradient method is developed for composite multi-objective optimization problems where each objective function can be represented as the sum of a smooth function and a nonsmooth…
We consider the standard optimistic bilevel optimization problem, in particular upper- and lower-level constraints can be coupled. By means of the lower-level value function, the problem is transformed into a single-level optimization…
We study the extragradient method for solving vector quasi-equilibrium problems in Banach spaces, which generalizes the extragradient method for vector equilibrium problems and scalar quasi-equilibrium problems. We propose a regularization…
We study composite optimization problems in which the smooth part of the objective function is \( p \)-times continuously differentiable, where \( p \geq 1 \) is an integer. Higher-order methods are known to be effective for solving such…
In this paper local Lipschitz regularity of weak solutions to certain singular elliptic equations involving one-Laplacian is studied. Equations treated here also contains another well-behaving elliptic operator such as $p$-Laplacian with…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
By means of Banach fixed point theorem , the uniqueness of Boltzmann Equation generalizaled Solutions in Sobolev spaces in $L^1(\mathbb{R}^+\times \mathbb{R}^n\times \mathbb{R}^n)$, can be proved as well as Boltzmann Equation renormalized…
In this paper, we study a generalized finite element method for solving second-order elliptic partial differential equations with rough coefficients. The method uses local approximation spaces computed by solving eigenvalue problems on…
We present a local convergence analysis of the Gauss-Newton-Kurchatov method for solving nonlinear least squares problems with a decomposition of the operator. The method uses the sum of the derivative of the differentiable part of the…
We consider Tikhonov-type variational regularization of ill-posed linear operator equations in Banach spaces with general convex penalty functionals. Upper bounds for certain error measures expressing the distance between exact and…
In this paper, we bring in General Landau-Lifshitz-Bloch equation and prove that it admits a local strong solution.
In this paper, using sunny generalized nonexpansive retraction, we propose new extragradient and linesearch algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a…
Motivated by machine learning problems over large data sets and distributed optimization over networks, we develop and analyze a new method called incremental Newton method for minimizing the sum of a large number of strongly convex…
It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a…
In this paper, we prove the existence of a unique maximal local strong solutions to a stochastic system for both 2D and 3D penalised nematic liquid crystals driven by multiplicative Gaussian noise. In the 2D case, we show that this solution…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
We establish a framework to construct a global solution in the space of finite energy to a general form of the Landau-Lifshitz-Gilbert equation in $\mathbb{R}^2$. Our characterization yields a partially regular solution, smooth away from a…
This paper considers the generalized continuation Newton method and thetrust-region updating strategy for the underdetermined system of nonlinear equations. Moreover, in order to improve its computational efficiency, the new method will not…
In this paper, applying the Newton method, we transform the complex continuous-time algebraic Riccati matrix equation into a Lyapunov equation. Then, we introduce an efficient general alternating-direction implicit (GADI) method to solve…