Related papers: Fifth Order Runge-Kutta-Nystr\"om Methods with Com…
Most numerical methods developed for solving nonlinear programming problems are designed to find points that satisfy certain optimality conditions. While the Karush-Kuhn-Tucker conditions are well-known, they become invalid when constraint…
The increasing precision of many experiments in elementary particle physics leads to continuing interest in perturbative higher order calculations in the electroweak Standard Model or extensions of it. Such calculations are of increasing…
The Butcher theory provides a powerful tool for analyzing order conditions of Runge-Kutta schemes for ordinary differential equations (ODEs); however, such a theory has not yet been well established for backward stochastic differential…
Robust estimation is much more challenging in high dimensions than it is in one dimension: Most techniques either lead to intractable optimization problems or estimators that can tolerate only a tiny fraction of errors. Recent work in…
Explicit Runge-Kutta (RK) integration of hyperbolic initial-boundary value problems with time-dependent Dirichlet data often displays order reduction: the observed convergence order falls below the nominal order because the stage structure…
We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge--Kutta--Legendre (RKL) and Runge--Kutta--Gegenbauer (RKG) super-time-stepping methods were…
Symmetry is a key property of numerical methods. The geometric properties of symmetric schemes make them an attractive option for integrating Hamiltonian systems, whilst their ability to exactly recover the initial condition without the…
Linearly implicit Runge-Kutta methods with approximate matrix factorization can solve efficiently large systems of differential equations that have a stiff linear part, e.g. reaction-diffusion systems. However, the use of approximate…
Implicit-explicit (IMEX) time stepping methods can efficiently solve differential equa- tions with both stiff and nonstiff components. IMEX Runge-Kutta methods and IMEX linear multistep methods have been studied in the literature. In this…
We propose a new method that extends conservative explicit multirate methods to implicit explicit-multirate methods. We develop extensions of order one and two with different stability properties on the implicit side. The method is suitable…
We introduce a family of stochastic optimization methods based on the Runge-Kutta-Chebyshev (RKC) schemes. The RKC methods are explicit methods originally designed for solving stiff ordinary differential equations by ensuring that their…
We study the application of the generalized convolution quadrature (gCQ) based on Runge--Kutta methods to approximate the solution of an important class of sectorial problems. The gCQ generalizes Lubich's original convolution quadrature…
We show that the probability of the exceptional set decays exponentially for a broad class of randomized algorithms approximating solutions of ODEs, admitting a certain error decomposition. This class includes randomized explicit and…
In this paper, a novel stochastic extra-step quasi-Newton method is developed to solve a class of nonsmooth nonconvex composite optimization problems. We assume that the gradient of the smooth part of the objective function can only be…
In the present paper, a robust approach to a special class of convex feasibility problems is considered. By techniques of convex and variational analysis, conditions for the existence of robust feasible solutions and related error bounds…
In this article, a family of two- and three-stage explicit multiquadric (MQ) and inverse multiquadric (IMQ) radial basis functions (RBFs) Runge-Kutta methods are introduced for solving ordinary differential equations. These methods are…
We study composite optimization problems in which the smooth part of the objective function is \( p \)-times continuously differentiable, where \( p \geq 1 \) is an integer. Higher-order methods are known to be effective for solving such…
A Newton-type active set algorithm for large-scale minimization subject to polyhedral constraints is proposed. The algorithm consists of a gradient projection step, a second-order Newton-type step in the null space of the constraint matrix,…
Robust Ordinal Regression (ROR) is a way of dealing with Multiple Criteria Decision Aiding (MCDA), by considering all sets of parameters of an assumed preference model, that are compatible with preference information given by the Decision…
In this paper, we consider nonlinear optimization problems with a stochastic objective function and deterministic equality constraints. We propose an inexact two-stepsize stochastic sequential quadratic programming (SQP) algorithm and…