From differential equation solvers to accelerated first-order methods for convex optimization
Convergence analysis of accelerated first-order methods for convex optimization problems
are developed from the point of view of ordinary differential equation solvers. A new …
are developed from the point of view of ordinary differential equation solvers. A new …
[图书][B] Swift analysis of civil engineering structures using graph theory methods
The dual requirements of accuracy and speed in analyzing structural systems with ever-
tighter design tolerances and larger numbers of elements have been relentlessly driving …
tighter design tolerances and larger numbers of elements have been relentlessly driving …
Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms
D Mitchell, N Ye, H De Sterck - Numerical Linear Algebra with …, 2020 - Wiley Online Library
We present Nesterov‐type acceleration techniques for alternating least squares (ALS)
methods applied to canonical tensor decomposition. While Nesterov acceleration turns …
methods applied to canonical tensor decomposition. While Nesterov acceleration turns …
Accelerated high-index saddle dynamics method for searching high-index saddle points
The high-index saddle dynamics (HiSD) method [J. Yin, L. Zhang, and P. Zhang,{\it SIAM J.
Sci. Comput.,} 41 (2019), pp. A3576-A3595] serves as an efficient tool for computing index …
Sci. Comput.,} 41 (2019), pp. A3576-A3595] serves as an efficient tool for computing index …
Entropy-stable hybridized discontinuous Galerkin methods for large-eddy simulation of transitional and turbulent flows
P Fernández - 2019 - dspace.mit.edu
Third, we introduced a non-modal analysis theory that characterizes the numerical
dissipation of high-order discretization schemes, including hybridized DG methods. Non …
dissipation of high-order discretization schemes, including hybridized DG methods. Non …
Nonlinearly preconditioned semismooth Newton algorithms for nonlinear nonsmooth systems
We aim to develop efficient and robust algorithms for nonsmooth nonlinear systems arising
from complementarity problems. The semismooth Newton algorithm is popular due to its …
from complementarity problems. The semismooth Newton algorithm is popular due to its …
Reduced-basis method for the iterative solution of parametrized symmetric positive-definite linear systems
We present a class of reduced basis (RB) methods for the iterative solution of parametrized
symmetric positive-definite (SPD) linear systems. The essential ingredients are a Galerkin …
symmetric positive-definite (SPD) linear systems. The essential ingredients are a Galerkin …
The long time behavior and the rate of convergence of symplectic convex algorithms obtained via splitting discretizations of inertial damping systems
CD Alecsa - arXiv preprint arXiv:2001.10831, 2020 - arxiv.org
In this paper we propose new numerical algorithms in the setting of unconstrained
optimization problems and we study the rate of convergence in the iterates of the objective …
optimization problems and we study the rate of convergence in the iterates of the objective …
An FPGA based electromagnetic transient analysis of power distribution network
The electrical power distribution network (PDN) is in the transition phase due to the
integration of distributed energy resources (DERs). Therefore, an accurate and efficient …
integration of distributed energy resources (DERs). Therefore, an accurate and efficient …
Successive projection for solving systems of nonlinear equations/inequalities
WJ Zeng, J Ye - arXiv preprint arXiv:2012.07555, 2020 - arxiv.org
Solving large-scale systems of nonlinear equations/inequalities is a fundamental problem in
computing and optimization. In this paper, we propose a generic successive projection (SP) …
computing and optimization. In this paper, we propose a generic successive projection (SP) …