Related papers: The minimum time function for the controlled Morea…
Temporal graphs have edge sets that change over discrete time steps. Such graphs are temporally connected (TC) if all pairs of vertices can reach each other using paths that traverse the edges in a time-respecting way (temporal paths).…
This paper addresses novel applications to practical modeling of the newly developed theory of necessary optimality conditions in controlled sweeping/Moreau processes with free time and pointwise control and state constraints. Problems of…
There are many significant applied contexts that require the solution of discontinuous optimization problems in finite dimensions. Yet these problems are very difficult, both computationally and analytically. With the functions being…
To solve convex optimization problems with a noisy gradient input, we analyze the global behavior of subgradient-like flows under stochastic errors. The objective function is composite, being equal to the sum of two convex functions, one…
We consider first-order methods with constant step size for minimizing locally Lipschitz coercive functions that are tame in an o-minimal structure on the real field. We prove that if the method is approximated by subgradient trajectories,…
In this paper, some preliminaries about Morgan problem, signal flow graph and controllable linear time-invariant standard system are first introduced in detail. In order to synthesize the necessary and sufficient condition for decoupling…
We study and compare three characteristic times of the standard map, the Lyapunov time t_L, the Poincare recurrence time t_r and the stickiness (or escape) time t_{st}. The Lyapunov time is the inverse of the Lyapunov characteristic number…
The presence of symmetries in a Hamiltonian system usually implies the existence of conservation laws that are represented mathematically in terms of the dynamical preservation of the level sets of a momentum mapping. The symplectic or…
The numerical method developed in [30] for optimal control problems involving sweeping processes with smooth sweeping set C is generalized to the case where C is nonsmooth, namely, C is the intersection of a finite number of sublevel sets…
Constrained optimization problems where both the objective and constraints may be nonsmooth and nonconvex arise across many learning and data science settings. In this paper, we show for any Lipschitz, weakly convex objectives and…
In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…
In this paper, we revisit the Mordukhovich's subdifferential criterion for Lipschitz continuity of nonsmooth functions and coderivative criterion for the Aubin/Lipschitz-like property of set-valued mappings in finite dimensions. The…
Let $G$ be an $n$-node simple directed planar graph with nonnegative edge weights. We study the fundamental problems of computing (1) a global cut of $G$ with minimum weight and (2) a~cycle of $G$ with minimum weight. The best previously…
Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…
We address the problem of computing a control for a time-dependent nonlinear system to reach a target set in a minimal time. To solve this minimal time control problem, we introduce a hierarchy of linear semi-infinite programs, the values…
We consider the game-theoretic approach to time-inconsistent stopping of a one-dimensional diffusion where the time-inconsistency is due to the presence of a non-exponential (weighted) discount function. In particular, we study (weak)…
We present an $m^{4/3+o(1)}\log W$-time algorithm for solving the minimum cost flow problem in graphs with unit capacity, where $W$ is the maximum absolute value of any edge weight. For sparse graphs, this improves over the best known…
This paper develops a new approach to small time local attainability of smooth manifolds of any dimension, possibly with boundary and to prove H\"older continuity of the minimum time function. We give explicit pointwise conditions of any…
In this paper, we investigate the asymptotic properties of a particular class of state-dependent sweeping processes. While extensive research has been conducted on the existence and uniqueness of solutions for sweeping processes, there is a…
We propose a single time-scale stochastic subgradient method for constrained optimization of a composition of several nonsmooth and nonconvex functions. The functions are assumed to be locally Lipschitz and differentiable in a generalized…