Related papers: The nonlinear steepest descent method for Riemann-…
This paper deals with convex nonsmooth optimization problems. We introduce a general smooth approximation framework for the original function and apply random (accelerated) coordinate descent methods for minimizing the corresponding smooth…
This paper deals with speeding up the convergence of a class of two-step iterative methods for solving linear systems of equations. To implement the acceleration technique, the residual norm associated with computed approximations for each…
This paper is devoted to the study of $L_p$ Lyapunov-type inequalities for linear systems of equations with Neumann boundary conditions and for any constant $p \geq 1$. We consider ordinary and elliptic problems. The results obtained in the…
We obtain an asymptotic expansion for the solution of the Cauchy problem for the Korteweg-de Vries (KdV) equation in the small dispersion limit near the point of gradient catastrophe (x_c,t_c) for the solution of the dispersionless…
We propose a simple, scalable, and fast gradient descent algorithm to optimize a nonconvex objective for the rank minimization problem and a closely related family of semidefinite programs. With $O(r^3 \kappa^2 n \log n)$ random…
This paper proposes a new steepest gradient descent method for solving nonconvex finite minimax problems using non-monotone adaptive step sizes and providing proof of convergence results in cases of the nonconvex, quasiconvex, and…
Steepest descent preconditioning is considered for the recently proposed nonlinear generalized minimal residual (N-GMRES) optimization algorithm for unconstrained nonlinear optimization. Two steepest descent preconditioning variants are…
In this work, we mainly consider the Cauchy problem for the reverse space-time nonlocal Hirota equation with the initial data rapidly decaying in the solitonless sector. Start from the Lax pair, we first construct the basis Riemann-Hilbert…
We introduce a randomly extrapolated primal-dual coordinate descent method that adapts to sparsity of the data matrix and the favorable structures of the objective function. Our method updates only a subset of primal and dual variables with…
We introduce a new numerical method to approximate the solutions of a class of stationary Hamilton-Jacobi (HJ) partial differential equations arising from minimum time optimal control problems. We rely on nested grid approximations, and…
In this paper we study the long time behavior for a semilinear wave equation with space-dependent and nonlinear damping term. After rewriting the equation as a first order system, we define a class of approximate solutions that employ…
The stability and convergence rate of Olver's collocation method for the numerical solution of Riemann-Hilbert problems (RHPs) is known to depend very sensitively on the particular choice of contours used as data of the RHP. By manually…
We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the properly rescaled…
In this paper, we study parametric nonlinear regression under the Harris recurrent Markov chain framework. We first consider the nonlinear least squares estimators of the parameters in the homoskedastic case, and establish asymptotic theory…
We consider the method of Reduction of Dissipativity Domain to prove global Lyapunov stability of Discrete Time Recurrent Neural Networks. The standard and advanced criteria for Absolute Stability of these essentially nonlinear systems…
We propose to use stochastic Riemannian coordinate descent on the orthogonal group for recurrent neural network training. The algorithm rotates successively two columns of the recurrent matrix, an operation that can be efficiently…
The Neumann--Neumann method is a commonly employed domain decomposition method for linear elliptic equations. However, the method exhibits slow convergence when applied to semilinear equations and does not seem to converge at all for…
We study statistical inverse learning in the context of nonlinear inverse problems under random design. Specifically, we address a class of nonlinear problems by employing gradient descent (GD) and stochastic gradient descent (SGD) with…
We study the asymptotic behavior of the discrete analogue of the holomorphic map $z^a$. The analysis is based on the use of the Riemann-Hilbert approach. Specifically, using the Deift-Zhou nonlinear steepest descent method we prove the…
This paper is the first in a forthcoming series of works where the authors study the global asymptotic behavior of the radial solutions of the 2D periodic Toda equation of type $A_n$. The principal issue is the connection formulae between…