Related papers: Anytime Solvers for Variational Inequalities: the …
Monotone systems, also known as order-preserving or cooperative systems, are prevalent in models of engineering applications such as transportation and biological networks. In this paper, we investigate the problem of finding a control…
This paper considers the problem of solving constrained reinforcement learning problems with anytime guarantees, meaning that the algorithmic solution returns a safe policy regardless of when it is terminated. Drawing inspiration from…
We propose stochastic variance reduced algorithms for solving convex-concave saddle point problems, monotone variational inequalities, and monotone inclusions. Our framework applies to extragradient, forward-backward-forward, and…
Fluid flows are omnipresent in nature and engineering disciplines. The reliable computation of fluids has been a long-lasting challenge due to nonlinear interactions over multiple spatio-temporal scales. The compressible Navier-Stokes…
In this paper we are concerned with the global existence of smooth solutions to the turbulent flow equations for compressible flows in $\mathbb{R}^3$. The global well-posedness is proved under the condition that the initial data are close…
An iterative learning algorithm is presented for continuous-time linear-quadratic optimal control problems where the system is externally symmetric with unknown dynamics. Both finite-horizon and infinite-horizon problems are considered. It…
Flow matching policies learn continuous velocity fields that transport noise to actions, enabling fast deterministic inference for robot manipulation. However, standard training optimizes a pointwise velocity objective while inference…
This paper presents a convex optimization-based framework for synthesizing time-varying controlled invariant funnels and associated feedback control around a given nominal trajectory for nonlinear systems subject to bounded disturbances.…
This paper presents a distributed continuous-time optimization framework aimed at overcoming the challenges posed by time-varying cost functions and constraints in multi-agent systems, particularly those subject to disturbances. By…
In this paper, we focus our attention on the large capacities unsplittable flow problem in a game theoretic setting. In this setting, there are selfish agents, which control some of the requests characteristics, and may be dishonest about…
Many combinatorial problems deal with preferences and violations, the goal of which is to find solutions with the minimum cost. Weighted constraint satisfaction is a framework for modeling such problems, which consists of a set of cost…
In this paper, we propose a second-order dynamical system with a smoothing effect for solving paramonotone variational inequalities. Under standard assumptions, we prove that the trajectories of this dynamical system converges to a solution…
Many large-scale and distributed optimization problems can be brought into a composite form in which the objective function is given by the sum of a smooth term and a nonsmooth regularizer. Such problems can be solved via a proximal…
In this paper, we propose two new solution schemes to solve the stochastic strongly monotone variational inequality problems: the stochastic extra-point solution scheme and the stochastic extra-momentum solution scheme. The first one is a…
Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in…
We propose a general algorithm to enumerate all solutions of a zero-dimensional polynomial system with respect to a given cost function. The algorithm is developed and is used to study a polynomial system obtained by discretizing the steady…
In this paper, we propose and analyze a mixed formulation for the Kelvin-Voigt-Brinkman-Forchheimer equations for unsteady viscoelastic flows in porous media. Besides the velocity and pressure, our approach introduces the vorticity as a…
This paper discusses the effect of sequential conflict resolution maneuvers of an infinite aircraft flow through a finite control volume. Aircraft flow models are utilized to simulate traffic flows and determine stability. Pseudo-random…
For simulating incompressible flows by projection methods. it is generally accepted that the pressure-correction stage is the most time-consuming part of the flow solver. The objective of the present work is to develop a fast hybrid…
This paper considers the problem of solving constrained reinforcement learning (RL) problems with anytime guarantees, meaning that the algorithmic solution must yield a constraint-satisfying policy at every iteration of its evolution. Our…