Related papers: New Optimization Methods for Converging Perturbati…
In a wide range of applications it is desirable to optimally control a dynamical system with respect to concurrent, potentially competing goals. This gives rise to a multiobjective optimal control problem where, instead of computing a…
We provide a framework for the numerical approximation of distributed optimal control problems, based on least-squares finite element methods. Our proposed method simultaneously solves the state and adjoint equations and is $\inf$--$\sup$…
In the context of unfitted finite element discretizations the realization of high order methods is challenging due to the fact that the geometry approximation has to be sufficiently accurate. We consider a new unfitted finite element method…
We propose an algebraic method that finds a sequence of functions that exponentially approach the solution of any second-order ordinary differential equation (ODE) with any boundary conditions. We define an extended ODE (eODE) composed of a…
We consider fourth order singularly perturbed eigenvalue problems in one-dimension and the approximation of their solution by the $h$ version of the Finite Element Method (FEM). In particular, we use piecewise Hermite polynomials of degree…
In this work, we investigate the numerical approximation of the second order non-autonomous semilnear parabolic partial differential equation (PDE) using the finite element method. To the best of our knowledge, only the linear case is…
The primary focus of this paper is on designing an inexact first-order algorithm for solving constrained nonlinear optimization problems. By controlling the inexactness of the subproblem solution, we can significantly reduce the…
A low-order nonconforming finite element discretization of a smooth de Rham complex starting from the $H^2$ space in three dimensions is proposed, involving an $H^2$-nonconforming finite element space, a new tangentially continuous…
A recent extension of a variationally optimized perturbation, combined with renormalization group properties in a straightforward way, can provide approximations to nonperturbative quantities such as the chiral symmetry breaking order…
This paper studies minimax optimization problems $\min_x \max_y f(x,y)$, where $f(x,y)$ is $m_x$-strongly convex with respect to $x$, $m_y$-strongly concave with respect to $y$ and $(L_x,L_{xy},L_y)$-smooth. Zhang et al. provided the…
Nuclear effective field theory organizes the calculation of observables as a power series in terms of the ratio of soft and hard momentum scales. The rigorous implementation of this idea requires a mixture of perturbative and…
Effective field theories (EFTs) provide a powerful framework to parametrise unknown aspects of possible ultraviolet (UV) physics. For scalar fields in de Sitter space, however, new emergent phenomena can arise when the cut-off scale of the…
High orders in perturbation theory can be calculated by the Lipatov method. For most field theories, the Lipatov asymptotics has the functional form c a^N \Gamma(N+b) (N is the order of perturbation theory); relative corrections to this…
Precision tests of QCD perturbation theory are not readily available from experimental data. The main reasons are systematic uncertainties due to the confinement of quarks and gluons, as well as kinematical constraints which limit the…
We prove a trade-off theorem for order and disorder parameters in one-dimensional quantum spin systems with quenched disorder. For a disordered ensemble with exact Ising symmetry and average translation symmetry, any gapped ensemble must…
Semidefinite programming (SDP) is widely acknowledged as one of the most effective methods for deriving the tightest lower bounds of the optimal power flow (OPF) problems. In this paper, an enhanced semidefinite relaxation model that…
High-dimensional chaotic dynamical systems can exhibit strongly transient features. These are often associated with instabilities that have finite-time duration. Because of the finite-time character of these transient events, their…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
This paper studies adaptive first-order least-squares finite element methods for second-order elliptic partial differential equations in non-divergence form. Unlike the classical finite element method which uses weak formulations of PDEs…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…