English
Related papers

Related papers: A uniform preconditioner for a Newton algorithm fo…

200 papers

This paper suggests two novel ideas to develop new proximal variable-metric methods for solving a class of composite convex optimization problems. The first idea is a new parameterization of the optimality condition which allows us to…

Optimization and Control · Mathematics 2018-12-14 Quoc Tran-Dinh , Liang Ling , Kim-Chuan Toh

The discretization of robust quadratic optimal control problems under uncertainty using the finite element method and the stochastic collocation method leads to large saddle-point systems, which are fully coupled across the random…

Numerical Analysis · Mathematics 2021-10-15 Fabio Nobile , Tommaso Vanzan

This paper presents a weakly intrusive strategy for computing a low-rank approximation of the solution of a system of nonlinear parameter-dependent equations. The proposed strategy relies on a Newton-like iterative solver which only…

Numerical Analysis · Mathematics 2020-05-06 Loic Giraldi , Anthony Nouy

A DualTPD method is proposed for solving nonlinear partial differential equations. The method is characterized by three main features. First, decoupling via Fenchel--Rockafellar duality is achieved, so that nonlinear terms are discretized…

Numerical Analysis · Mathematics 2025-10-20 Long Chen , Ruchi Guo , Jingrong Wei , Jun Zou

In this note, we consider preconditioned Krylov subspace methods for discrete fluid-structure interaction problems with a nonlinear hyperelastic material model and covering a large range of flows, e.g, water, blood, and air with highly…

Numerical Analysis · Mathematics 2016-03-15 U. Langer , H. Yang

We introduce the Neural Preconditioning Operator (NPO), a novel approach designed to accelerate Krylov solvers in solving large, sparse linear systems derived from partial differential equations (PDEs). Unlike classical preconditioners that…

Computational Engineering, Finance, and Science · Computer Science 2025-02-10 Zhihao Li , Di Xiao , Zhilu Lai , Wei Wang

In this paper, we consider effective discretization strategies and iterative solvers for nonlinear PDE-constrained optimization models for pattern evolution within biological processes. Upon a Sequential Quadratic Programming linearization…

Numerical Analysis · Mathematics 2024-08-28 Karolína Benková , John W. Pearson , Mariya Ptashnyk

In this paper we present a unified framework for constructing spectrally equivalent low-order-refined discretizations for the high-order finite element de Rham complex. This theory covers diffusion problems in $H^1$, $H({\rm curl})$, and…

Numerical Analysis · Mathematics 2023-04-26 Will Pazner , Tzanio Kolev , Clark Dohrmann

We develop a novel primal-dual algorithm to solve a class of nonsmooth and nonlinear compositional convex minimization problems, which covers many existing and brand-new models as special cases. Our approach relies on a combination of a new…

Optimization and Control · Mathematics 2021-04-20 Yuzixuan Zhu , Deyi Liu , Quoc Tran-Dinh

This paper introduces a novel Transformed Primal-Dual with variable-metric/preconditioner (TPDv) algorithm, designed to efficiently solve affine constrained optimization problems common in nonlinear partial differential equations (PDEs).…

Numerical Analysis · Mathematics 2023-12-20 Long Chen , Ruchi Guo , Jingrong Wei

Optimal transport problems pose many challenges when considering their numerical treatment. We investigate the solution of a PDE-constrained optimisation problem subject to a particular transport equation arising from the modelling of image…

Numerical Analysis · Mathematics 2018-01-15 Roland Herzog , John W. Pearson , Martin Stoll

We propose and study a novel stochastic inertial primal-dual approach to solve composite optimization problems. These latter problems arise naturally when learning with penalized regularization schemes. Our analysis provide convergence…

Optimization and Control · Mathematics 2015-07-06 Lorenzo Rosasco , Silvia Villa , Bang Cong Vu

Preconditioning has long been a staple technique in optimization, often applied to reduce the condition number of a matrix and speed up the convergence of algorithms. Although there are many popular preconditioning techniques in practice,…

Optimization and Control · Mathematics 2022-11-08 Zhaonan Qu , Wenzhi Gao , Oliver Hinder , Yinyu Ye , Zhengyuan Zhou

We consider parametric families of partial differential equations--PDEs where the parameter $\kappa$ modifies only the (1,1) block of a saddle point matrix product of a discretization below. The main goal is to develop an algorithm that…

Numerical Analysis · Mathematics 2021-06-11 O. Andrés Cuervo , Juan Galvis , Marcus Sarkis

This work presents and analyzes space-time finite element methods on fully unstructured simplicial space-time meshes for the numerical solution of parabolic optimal control problems. Using Babu\v{s}ka's theorem, we show well-posedness of…

Numerical Analysis · Mathematics 2020-04-07 Ulrich Langer , Olaf Steinbach , Fredi Tröltzsch , Huidong Yang

For the solution of discrete ill-posed problems, in this paper a novel preconditioned iterative method based on the Arnoldi algorithm for matrix functions is presented. The method is also extended to work in connection with Tikhonov…

Numerical Analysis · Mathematics 2011-11-18 Paolo Novati , Michela Redivo-Zaglia , Maria Rosaria Russo

High-order implicit shock tracking (fitting) is a class of high-order numerical methods that use numerical optimization to simultaneously compute a high-order approximation to a conservation law solution and align elements of the…

Numerical Analysis · Mathematics 2024-06-28 Jakob Vandergrift , Matthew J. Zahr

We consider a space-time finite element method on fully unstructured simplicial meshes for optimal sparse control of semilinear parabolic equations. The objective is a combination of a standard quadratic tracking-type functional including a…

Numerical Analysis · Mathematics 2020-04-01 Ulrich Langer , Olaf Steinbach , Fredi Tröltzsch , Huidong Yang

In this work, we develop first-order (Hessian-free) and zero-order (derivative-free) implementations of the Cubically regularized Newton method for solving general non-convex optimization problems. For that, we employ finite difference…

Optimization and Control · Mathematics 2023-09-06 Nikita Doikov , Geovani Nunes Grapiglia

For linear problems, domain decomposition methods can be used directly as iterative solvers, but also as preconditioners for Krylov methods. In practice, Krylov acceleration is almost always used, since the Krylov method finds a much better…

Numerical Analysis · Mathematics 2016-05-17 V. Dolean , M. J. Gander , F. Kwok , R. Masson , W. Kheriji