Skip to content

Parareal Algorithm For Gradient Flow Arising From Orthogonality-Constrained Matrix Optimization Problems

Aug 2026 · Journal of Scientific Computing · Vol 109 · 0 citations · 56 references

TL;DR

This paper presents a rigorous convergence analysis of parareal for this nonlinear matrix gradient flow when classical numerical schemes are used as the fine and coarse propagators, and derived superlinear convergence result provides a more comprehensive theoretical characterization of discretization- and problem-dependent quantities.

View source

Similar papers

Sep 2026

An Inexact Interior-Point Relaxation Method for Linear Optimization with a Spectral Preconditioner

This paper proposes an inexact interior-point relaxation method (iIPRM) for LO problems that does not require its iterates to remain strictly positive and employs a sparse preconditioner tailored to the structure of the normal matrix.

Rui-Jin Zhang, Yu-Hong Dai, Xin-Wei Liu et al. · 0 citations
Preprint Sep 2026

A novel parallel approach for solving some free boundary value problems

This paper introduces a novel, efficient class of parallel direct and indirect iterative schemes to solve general obstacle and free boundary value problems. The uniqueness of the solution for the direct parallel method is established under the assumption that the model problem yields an $M$-matrix. The convergence anal...

P. Singh, Amboru Yalmanda · 0 citations
Open access Sep 2026

A Sequential Quadratic Numerical Optimization Technique to Compute Critical Flutter Speeds

A stable sequential quadratic numerical optimization technique is proposed to compute critical flutter speeds without resorting to complex algebra. The solution of the traditional eigenproblem stated in the frequency domain, and whose complex conjugate eigenvalues provide insights on the stability of the dynamic aero...

A. D. de Faria · 0 citations
#machine learning Preprint Sep 2026

lapanda: A Matrix-Free Differentiable Solver for Nonconvex Constrained Optimization Layers

This work reformulates the problem to a sequence of augmented Lagrangian subproblems, each handled by a first-order inner solver through a proximal averaged quasi-Newton algorithm with adaptive linesearch, thus enabling efficient forward optimization.

Yuan-Kun Chen, Zi-Fei Nie, Kang-Yu Lin et al. · 0 citations
Preprint Aug 2026

A Globally Convergent Algorithm for Total Scaled-Gradient Variation via Cone-Constrained Bilinear Decomposition

The proposed reformulation of the total scaled-gradient variation regularizer achieves PSNR and SSIM competitive with or superior to representative variational methods, especially at high noise levels, and improves the structural reconstruction under dense and sparse scanning.

Hai-Bin Su, Chunlin Wu, Huibin Chang et al. · 0 citations
Preprint Sep 2026

Optimal Recovery for Solving Variational Problems

In science and engineering, many physical laws and scientific principles naturally arise as variational problems of minimizing an energy functional over an appropriate functional space. In many cases, it is more advantageous to directly discover the minimizer of the energy functional than to solve the associated Euler-...

Ting Wang, Gideon Simpson, Jaroslaw Knap · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.