Related papers: Strong-stability-preserving additive linear multis…
Steplength thresholds for invariance preserving of three types of discretization methods on a polyhedron are considered. For Taylor approximation type discretization methods we prove that a valid steplength threshold can be obtained by…
Recent work has shown that stochastically perturbed gradient methods can efficiently escape strict saddle points of smooth functions. We extend this body of work to nonsmooth optimization, by analyzing an inexact analogue of a…
We propose two new alternating direction methods to solve "fully" nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and…
In power system steady-state estimation (PSSE), one needs to consider (1) the need for robust statistics, (2) the nonconvex transmission constraints, (3) the fast-varying nature of the inputs, and the corresponding need to track optimal…
In this note we consider splitting methods based on linear multistep methods and stabilizing corrections. To enhance the stability of the methods, we employ an idea of Bruno & Cubillos (2016) who combine a high-order extrapolation formula…
Dynamical systems with sub-processes evolving on many different time scales are ubiquitous in applications. Their efficient solution is greatly enhanced by automatic time step variation. This paper is concerned with the theory, construction…
This paper aims to investigate the numerical approximation of a general second order parabolic stochastic partial differential equation(SPDE) driven by multiplicative and additive noise under more relaxed conditions. The SPDE is discretized…
This paper presents a comprehensive analysis of a broad range of variations of the stochastic proximal point method (SPPM). Proximal point methods have attracted considerable interest owing to their numerical stability and robustness…
Today's complex robotic designs comprise in some cases a large number of degrees of freedom, enabling for multi-objective task resolution (e.g., humanoid robots or aerial manipulators). This paper tackles the stability problem of a…
Recently, there has been great interest in connections between continuous-time dynamical systems and optimization methods, notably in the context of accelerated methods for smooth and unconstrained problems. In this paper we extend this…
In this paper, pseudo-transient continuation method has been modified and implemented in power system long-term stability analysis. This method is a middle ground between integration and steady state calculation, thus is a good compromise…
Strong stability preserving (SSP) Runge-Kutta methods are desirable when evolving in time problems that have discontinuities or sharp gradients and require nonlinear non-inner-product stability properties to be satisfied. Unlike the case…
We present a method for the steady state optimization of nonlinear delay differential equations. The method ensures stability and robustness, where a system is called robust if it remains stable despite uncertain parameters. Essentially, we…
We show that stochastic acceleration can be achieved under the perturbed iterate framework (Mania et al., 2017) in asynchronous lock-free optimization, which leads to the optimal incremental gradient complexity for finite-sum objectives. We…
Typical fully conservative discretizations of the Euler compressible single or multi-component fluid equations governed by a real-fluid equation of state exhibit spurious pressure oscillations due to the nonlinearity of the thermodynamic…
Set-based integration methods allow to prove properties of differential systems, which take into account bounded disturbances. The systems (either time-discrete, time-continuous or hybrid) satisfying such properties are said to be "robust".…
In this work, we propose a nonlinear stabilization technique for scalar conservation laws with implicit time stepping. The method relies on an artificial diffusion method, based on a graph-Laplacian operator. It is nonlinear, since it…
The stochastic Polyak step size (SPS) has proven to be a promising choice for stochastic gradient descent (SGD), delivering competitive performance relative to state-of-the-art methods on smooth convex and non-convex optimization problems,…
We consider the development of high order asymptotic-preserving linear multistep methods for kinetic equations and related problems. The methods are first developed for BGK-like kinetic models and then extended to the case of the full…
We generalize the theory of underlying one-step methods to strictly stable general linear methods (GLMs) solving nonautonomous ordinary differential equations (ODEs) that satisfy a global Lipschitz condition. We combine this theory with the…