Related papers: On a semismooth* Newton method for solving general…
In this paper we use the GeneralizedMultiscale Finite ElementMethod (GMsFEM) framework, introduced in [20], in order to solve nonlinear elliptic equations with high-contrast coefficients. The proposed solution method involves linearizing…
Numerical investigations of partial differential equations with hysteresis have largely focused on simulations, leaving numerical error analysis unexplored and relying mainly on derivative-free nonlinear solvers. This work establishes…
We present a method to solve a special class of parameter identification problems for an elliptic optimal control problem to global optimality. The bilevel problem is reformulated via the optimal-value function of the lower-level problem.…
We address the numerical solution of second-order Mean Field Game problems through Newton iterations in infinite dimensions, introduced in [14], where quadratic convergence of the method was rigorously established. Building upon this…
We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…
In this paper, inexact Gauss-Newton like methods for solving injective-overdetermined systems of equations are studied. We use a majorant condition, defined by a function whose derivative is not necessarily convex, to extend and improve…
Minimizing loss functions is central to machine-learning training. Although first-order methods dominate practical applications, higher-order techniques such as Newton's method can deliver greater accuracy and faster convergence, yet are…
This paper proposes new proximal Newton-type methods with a diagonal metric for solving composite optimization problems whose objective function is the sum of a twice continuously differentiable function and a proper closed directionally…
The secant method is a very effective numerical procedure used for solving nonlinear equations of the form $f(x)=0$. In a recent work [A. Sidi, Generalization of the secant method for nonlinear equations. {\em Appl. Math. E-Notes},…
An efficient approximate version of implicit Taylor methods for initial-value problems of systems of ordinary differential equations (ODEs) is introduced. The approach, based on an approximate formulation of Taylor methods, produces a…
This paper focuses on discussing Newton's method and its hybrid with machine learning for the steady state Navier-Stokes Darcy model discretized by mixed element methods. First, a Newton iterative method is introduced for solving the…
The discretization of Gross-Pitaevskii equations (GPE) leads to a nonlinear eigenvalue problem with eigenvector nonlinearity (NEPv). In this paper, we use two Newton-based methods to compute the positive ground state of GPE. The first…
We study a class of monotone inclusions called "self-concordant inclusion" which covers three fundamental convex optimization formulations as special cases. We develop a new generalized Newton-type framework to solve this inclusion. Our…
We propose \textbf{NewVEM}, a Newton vertex exchange method for efficiently solving self-concordant minimization problems under generalized simplex constraints. The algorithm features a two-level structure: the outer loop employs a…
We propose a novel trust region method for solving a class of nonsmooth, nonconvex composite-type optimization problems. The approach embeds inexact semismooth Newton steps for finding zeros of a normal map-based stationarity measure for…
Generated Jacobian Equations have been introduced by Trudinger [Disc. cont. dyn. sys (2014), pp. 1663-1681] as a generalization of Monge-Amp{\`e}re equations arising in optimal transport. In this paper, we introduce and study a damped…
We discuss a new version of a method for obtaining exact solutions of nonlinear partial differential equations. We call this method the Simple Equations Method (SEsM). The method is based on representation of the searched solution as…
In this paper, we present an efficient semismooth Newton method, named SSNCP, for solving a class of semidefinite programming problems. Our approach is rooted in an equivalent semismooth system derived from the saddle point problem induced…
This paper proposes two proximal Newton-CG methods for convex nonsmooth optimization problems in composite form. The algorithms are based on a a reformulation of the original nonsmooth problem as the unconstrained minimization of a…
A new continuous regularized Gauss-Newton-type method with simultaneous updates of the operator $(F^{\pr*}(x(t))F'(x(t))+\ep(t) I)^{-1}$ for solving nonlinear ill-posed equations in a Hilbert space is proposed. A convergence theorem is…