Related papers: Stability of first-order methods in tame optimizat…
Minimax optimization problems are an important class of optimization problems arising from both modern machine learning and from traditional research areas. We focus on the stability of constrained minimax optimization problems based on the…
Approximation theory for Lyapunov and Sacker-Sell spectra based upon QR techniques is used to analyze the stability of a one-step method solving a time-dependent, linear, ordinary differential equation (ODE) initial value problem in terms…
This paper delves into stochastic optimization problems that involve Markovian noise. We present a unified approach for the theoretical analysis of first-order gradient methods for stochastic optimization and variational inequalities. Our…
Given a proper convex lower semicontinuous function defined on a Hilbert space and whose solution set is supposed nonempty. For attaining a global minimizer when this convex function is continuously differentiable, we approach it by a…
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs,…
Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been established for these…
This paper is concerned with first- and second-order optimality conditions as well as the stability for non-smooth semilinear optimal control problems involving the $L^1$-norm of the control in the cost functional. In addition to the…
We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.
Invex programs are a special kind of non-convex problems which attain global minima at every stationary point. While classical first-order gradient descent methods can solve them, they converge very slowly. In this paper, we propose new…
We extend the notion of numerical stability of finite difference approximations to include hyperbolic systems that are first order in time and second order in space, such as those that appear in Numerical Relativity. By analyzing the symbol…
In this work we introduce and analyze a novel Hybrid High-Order method for the steady incompressible Navier-Stokes equations. The proposed method is inf-sup stable on general polyhedral meshes, supports arbitrary approximation orders, and…
Probabilistic solvers for ordinary differential equations (ODEs) provide efficient quantification of numerical uncertainty associated with simulation of dynamical systems. Their convergence rates have been established by a growing body of…
We propose a computational approach to estimate the stability domain of quadratic-bilinear reduced-order models (ROMs), which are low-dimensional approximations of large-scale dynamical systems. For nonlinear ROMs, it is not only important…
We consider a family of conforming space-time finite element discretizations for the wave equation based on splines of maximal regularity in time. Traditional techniques may require a CFL condition to guarantee stability. Recent works by O.…
We consider finite element approximations of unique continuation problems subject to elliptic equations in the case where the normal derivative of the exact solution is known to reside in some finite dimensional space. To give quantitative…
We use the linear scalar SDE as a test problem to show that it is possible to construct almost sure stable first-order weak balanced schemes based on the addition of stabilizing functions to the drift terms. Then, we design balanced schemes…
The analysis of gradient descent-type methods typically relies on the Lipschitz continuity of the objective gradient. This generally requires an expensive hyperparameter tuning process to appropriately calibrate a stepsize for a given…
This paper develops a new approach to the estimation of the degree of boundedness or stability of multidimensional nonlinear systems with time-dependent nonperiodic coefficients-an essential task in various engineering and natural science…
Discontinuous Galerkin methods of higher order are applied as temporal discretizations for the transient Navier--Stokes equations. The spatial discretization based on inf-sup stable pairs of finite element spaces is stabilised using a…
This work provides the first finite-time convergence guarantees for linearly constrained stochastic bilevel optimization using only first-order methods, requiring solely gradient information without any Hessian computations or second-order…