Related papers: The hypersecant Jacobian approximation for quasi-N…
The combination of nonlinear FETI-DP (Dual Primal Finite Element Tearing and Interconnecting) and Quasi-Newton methods using a sequential quadratic programming (SQP) approach is considered. Nonlinear FETI-DP methods are parallel iterative…
We apply the semi-discrete method, c.f. \emph{N. Halidias and I.S. Stamatiou (2016), On the numerical solution of some non-linear stochastic differential equations using the semi-discrete method, Computational Methods in Applied…
We introduce a weak notion of $2\times 2$-minors of gradients of a suitable subclass of $BV$ functions. In the case of maps in $BV(\mathbb{R}^2;\mathbb{R}^2)$ such a notion extends the standard definition of Jacobian determinant to…
The eigenvalue problem is a fundamental problem in scientific computing. In this paper, we first give the error analysis for a single step or sweep of Jacobi's method in floating point arithmetic. Then we propose a mixed precision…
We present a first step towards a multigrid method for solving the min-cost flow problem. Specifically, we present a strategy that takes advantage of existing black-box fast iterative linear solvers, i.e. algebraic multigrid methods. We…
We show that, under certain circumstances, it is possible to automatically compute Jacobian-inverse-vector and Jacobian-inverse-transpose-vector products about as efficiently as Jacobian-vector and Jacobian-transpose-vector products. The…
The paradigm of differentiable programming has significantly enhanced the scope of machine learning via the judicious use of gradient-based optimization. However, standard differentiable programming methods (such as autodiff) typically…
In this paper, we propose a quasi Newton method to solve the robust counterpart of an uncertain multiobjective optimization problem under an arbitrary finite uncertainty set. Here the robust counterpart of an uncertain multiobjective…
This paper considers the hyperparameter optimization problem of mathematical techniques that arise in the numerical solution of differential and integral equations. The well-known approaches grid and random search, in a parallel algorithm…
We consider the neural sparse representation to solve Boltzmann equation with BGK and quadratic collision model, where a network-based ansatz that can approximate the distribution function with extremely high efficiency is proposed.…
Local superlinear convergence of the semismooth Newton method usually necessitates assumptions on the uniform invertibility of the utilized, generalized Jacobian matrices, such as, e.g., BD- or CD-regularity. For certain composite-type…
This paper introduces the sparsifying preconditioner for the pseudospectral approximation of highly indefinite systems on periodic structures, which include the frequency-domain response problems of the Helmholtz equation and the…
We propose the sparse modeling approach for quasiclassical theory of superconductivity, which reduces the computational cost of solving the gap equations. The recently proposed sparse modeling approach is based on the fact that the Green's…
We consider the well-posedness and numerical approximation of a Hamilton--Jacobi equation on an evolving hypersurface in $\mathbb R^3$. Definitions of viscosity sub- and supersolutions are extended in a natural way to evolving hypersurfaces…
We provide convergence rates for space approximations of semi-linear stochastic differential equations with multiplicative noise in a Hilbert space. The space approximations we consider are spectral Galerkin and finite elements, and the…
We study the well-posedness of an infinite-dimensional Hamilton-Jacobi equation posed on the set of non-negative measures and with a monotonic non-linearity. Our results will be used in a companion work to propose a conjecture and prove…
Bilevel optimization has arisen as a powerful tool in modern machine learning. However, due to the nested structure of bilevel optimization, even gradient-based methods require second-order derivative approximations via Jacobian- or/and…
For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate…
A new algorithm for time dependent Hamilton Jacobi equations on networks, based on semi Lagrangian scheme, is proposed. It is based on the definition of viscosity solution for this kind of problems recently given in. A thorough convergence…
The work concerns the nonlinear filtering problem for a class of multiscale McKean-Vlasov stochastic systems. First of all, by a Poisson equation we prove that the solution of the slow part for a multiscale system weakly converges to the…