Related papers: Two Typical Implementable Semismooth* Newton Metho…

In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since…

A generalization of the Newton-based matrix splitting iteration method (GNMS) for solving the generalized absolute value equations (GAVEs) is proposed. Under mild conditions, the GNMS method converges to the unique solution of the GAVEs.…

In this paper, we propose a uniform semismooth Newton-based algorithmic framework called SSNCVX for solving a broad class of convex composite optimization problems. By exploiting the augmented Lagrangian duality, we reformulate the original…

The Generalized Method of Moments (GMM) is a partition of unity based technique for solving electromagnetic and acoustic boundary integral equations. Past work on the GMM for electromagnetics was confined to geometries modeled by piecewise…

This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…

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 develop an implementable stochastic proximal point (SPP) method for a class of weakly convex, composite optimization problems. The proposed stochastic proximal point algorithm incorporates a variance reduction mechanism and the resulting…

In this paper, we introduce a quasi-Newton method optimized for efficiently solving quasi-linear elliptic equations and systems, with a specific focus on GPU-based computation. By approximating the Jacobian matrix with a combination of…

Newton-type methods enjoy fast local convergence and strong empirical performance, but achieving global guarantees comparable to first-order methods remains challenging. Even for simple strongly convex problems, no straightforward variant…

Smoothness of generalized solutions for higher-order elliptic equations with nonlocal boundary conditions is studied in plane domains. Necessary and sufficient conditions upon the right-hand side of the problem and nonlocal operators under…

Recent studies have shown that many nonconvex machine learning problems satisfy a generalized-smooth condition that extends beyond traditional smooth nonconvex optimization. However, the existing algorithms are not fully adapted to such…

This paper is devoted to the numerical solution of the non-isothermal instationary Bingham flow with temperature dependent parameters by semismooth Newton methods. We discuss the main theoretical aspects regarding this problem. Mainly, we…

We study Newton type methods for inverse problems described by nonlinear operator equations $F(u)=g$ in Banach spaces where the Newton equations $F'(u_n;u_{n+1}-u_n) = g-F(u_n)$ are regularized variationally using a general data misfit…

In this manuscript, we propose a general proximal quasi-Newton method tailored for nonconvex and nonsmooth optimization problems, where we do not require the sequence of the variable metric (or Hessian approximation) to be uniformly bounded…

The traditional Newton method for solving nonlinear operator equations in Banach spaces is discussed within the context of the continuous Newton method. This setting makes it possible to interpret the Newton method as a discrete dynamical…

We propose a higher-order method for solving non-smooth optimization problems on manifolds. In order to obtain superlinear convergence, we apply a Riemannian Semi-smooth Newton method to a non-smooth non-linear primal-dual optimality system…

First-order optimization methods, such as stochastic gradient descent (SGD) and its variants, are widely used in machine learning applications due to their simplicity and low per-iteration costs. However, they often require larger numbers…

In this paper, we investigate global convergence properties of the inexact nonsmooth Newton method for solving the system of absolute value equations (AVE). Global $Q$-linear convergence is established under suitable assumptions. Moreover,…

This work investigates the application of the Newton's method for the numerical solution of a nonlinear boundary value problem formulated through an ordinary differential equation (ODE). Nonlinear ODEs arise in various mathematical modeling…

We develop a randomized Newton method capable of solving learning problems with huge dimensional feature spaces, which is a common setting in applications such as medical imaging, genomics and seismology. Our method leverages randomized…