Related papers: Free Versus Constrained Evolution of the 2+1 Equiv…
Evolutionary strategies have recently been shown to achieve competing levels of performance for complex optimization problems in reinforcement learning. In such problems, one often needs to optimize an objective function subject to a set of…
We introduce a new class of parametricization structure-preserving partitioned Runge-Kutta ($\alpha$-PRK) methods for Hamiltonian systems with holonomic constraints. When the scalar parameter $\alpha=0$, the methods are reduced to the usual…
In this work we present a new class of Runge-Kutta (RK) methods for solving systems of hyperbolic equations with a particular structure, generalization of a wave-equation. The new methods are {\it partially implicit} in the sense that a…
Singly-TASE operators for the numerical solution of stiff differential equations were proposed by Calvo et al. in J.Sci. Comput. 2023 to reduce the computational cost of Runge-Kutta-TASE (RKTASE) methods when the involved linear systems are…
Stabilized Runge-Kutta methods are especially efficient for the numerical solution of large systems of stiff nonlinear differential equations because they are fully explicit. For semi-discrete parabolic problems, for instance, stabilized…
Addressing a complex real-world optimization problem is a challenging task. The chance-constrained knapsack problem with correlated uniform weights plays an important role in the case where dependent stochastic components are considered. We…
Randomized search heuristics such as evolutionary algorithms are frequently applied to dynamic combinatorial optimization problems. Within this paper, we present a dynamic model of the classic Weighted Vertex Cover problem and analyze the…
We present a C++ implementation of a fifth order semi-implicit Runge-Kutta algorithm for solving Ordinary Differential Equations. This algorithm can be used for studying many different problems and in particular it can be applied for…
Explicit integrating factor Runge-Kutta methods are attractive and popular in developing high-order maximum bound principle preserving time-stepping schemes for Allen-Cahn type gradient flows. However, they always suffer from the…
Isospectral Runge-Kutta methods are well-suited for the numerical solution of isospectral systems such as the rigid body and the Toda lattice. More recently, these integrators have been applied to geophysical fluid models, where their…
In this paper, we analyze any-order Runge-Kutta spectral volume schemes (RKSV(s,k)) for solving the one-dimensional scalar hyperbolic equation. The RKSV(s,k) was constructed by using the $s$-th explicit Runge-Kutta method in…
We introduce a class of high order accurate, semi-implicit Runge-Kutta schemes in the general setting of evolution equations that arise as gradient flow for a cost function, possibly with respect to an inner product that depends on the…
We study the optimal control of a rate-independent system that is driven by a convex, quadratic energy. Since the associated solution mapping is non-smooth, the analysis of such control problems is challenging. In order to derive optimality…
Safe reinforcement learning (RL) studies problems where an intelligent agent has to not only maximize reward but also avoid exploring unsafe areas. In this study, we propose CUP, a novel policy optimization method based on Constrained…
We discuss an analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring, in terms of an effective energy landscape. Several intriguing geometrical properties of the solution space become in this light…
Finite differences and Runge-Kutta time stepping schemes used in Computational AeroAcoustics simulations are often optimized for low dispersion and dissipation (e.g. DRP or LDDRK schemes) when applied to linear problems in order to…
We propose a novel approach for sampling-based and control-based motion planning that combines a representation of the environment obtained via a modified version of optimal Rapidly-exploring Random Trees (RRT*), with landmark-based…
Based on the combinatory theory of rooted colored trees, we investigate the conditions for the explicit stochastic Runge-Kutta (SRK) methods to preserve quadratic invariants (QI) up to certain orders of accuracy. These conditions can supply…
This work presents two new algorithms for performing constraint satisfaction. The first algorithm presented, DMaxWalkSat, is a constraint solver specialized for solving dynamic, weighted constraint satisfaction problems. The second…
We consider the energy-critical wave maps equation $\mathbb R^{1+2} \to \mathbb S^2$ in the equivariant case, with equivariance degree $k \geq 2$. It is known that initial data of energy $ < 8k\pi$ and topological degree zero leads to…