English
Related papers

Related papers: The minimum time function for the controlled Morea…

200 papers

We consider a class of nonsmooth and nonconvex optimization problems over the Stiefel manifold where the objective function is the summation of a nonconvex smooth function and a nonsmooth Lipschitz continuous convex function composed with…

Optimization and Control · Mathematics 2023-03-28 Jinlai Zhu , Jianfeng Huang , Lihua Yang , Qia Li

We analyze the global and local behavior of gradient-like flows under stochastic errors towards the aim of solving convex optimization problems with noisy gradient input. We first study the unconstrained differentiable convex case, using a…

Optimization and Control · Mathematics 2024-03-12 Rodrigo Maulen-Soto , Jalal Fadili , Hedy Attouch

This work is concerned with the necessary conditions of optimality for a minimal time control problem $(P)$ for the linearized Navier-Stokes periodic flow in a 2D-channel, subject to a boundary input which acts on the transversal component…

Analysis of PDEs · Mathematics 2020-06-30 Gabriela Marinoschi

Solving the Plateau problem means to find the surface with minimal area among all surfaces with a given boundary. Part of the problem actually consists of giving a suitable definition to the notions of 'surface', 'area' and 'boundary'. In…

Classical Analysis and ODEs · Mathematics 2018-07-17 Edoardo Cavallotto

The paper is devoted to deriving necessary optimality conditions in a general optimal control problem for dynamical systems governed by controlled sweeping processes with hard-constrained control actions entering both polyhedral moving sets…

Optimization and Control · Mathematics 2021-03-17 Tan H. Cao , Giovanni Colombo , Boris S. Mordukhovich , Dao Nguyen

Given a simple, undirected graph $G$ with a threshold function $\tau:V(G) \rightarrow \mathbb{N}$, the \textsc{Target Set Selection} (TSS) problem is about choosing a minimum cardinality set, say $S \subseteq V(G)$, such that starting a…

Computational Complexity · Computer Science 2021-05-18 Suman Banerjee , Rogers Mathew , Fahad Panolan

This paper is devoted to the analysis of a finite horizon discrete-time stochastic optimal control problem, in presence of constraints. We study the regularity of the value function which comes from the dynamic programming algorithm. We…

Optimization and Control · Mathematics 2007-05-23 M. Papi , S. Sbaraglia

Consider the graph induced by $\mathbb{Z}^d$, equipped with uniformly elliptic random conductances. At time $0$, place a Poisson point process of particles on $\mathbb{Z}^d$ and let them perform independent simple random walks. Tessellate…

Probability · Mathematics 2019-04-02 Peter Gracar , Alexandre Stauffer

Dynamics of homogeneous moving vortex matter is considered beyond the linear response. The framework is the time dependent Ginzburg - Landau equation within the lowest Landau level approximation. Both disorder and thermal fluctuations are…

Superconductivity · Physics 2007-05-23 Golan Bel , Baruch Rosenstein

In this paper we focus on a general type of mean-field stochastic control problem with partial observation, in which the coefficients depend in a non-linear way not only on the state process $X_t$ and its control $u_t$ but also on the…

Optimization and Control · Mathematics 2021-11-23 Juan Li , Hao Liang , Chao Mi

We consider a mean-field control problem in which admissible controls are required to be adapted to the common noise filtration. The main objective is to show how the mean-field control problem can be approximates by time consistent…

Optimization and Control · Mathematics 2025-09-19 Bruno Bouchard , Xiaolu Tan

We study the existence of solutions to general measure-minimization problems over topological classes that are stable under localized Lipschitz homotopy, including the standard Plateau problem without the need for restrictive assumptions…

Metric Geometry · Mathematics 2009-09-29 Vincent Feuvrier

The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We introduce a new notion…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-01-09 Anisur Rahaman Molla , Gopal Pandurangan

A target set selection model is a graph $G$ with a threshold function $\tau:V\to \mathbb{N}$ upper-bounded by the vertex degree. For a given model, a set $S_0\subseteq V(G)$ is a target set if $V(G)$ can be partitioned into non-empty…

Data Structures and Algorithms · Computer Science 2020-07-13 Lucas Keiler , Carlos Vinicius G. C. Lima , Ana Karolinna Maia , Rudini Sampaio , Ignasi Sau

In this paper, we address two minimal controllability problems, where the goal is to determine a minimal subset of state variables in a linear time-invariant system to be actuated to ensure controllability under additional constraints.…

Optimization and Control · Mathematics 2016-04-20 Sergio Pequito , Guilherme Ramos , Soummya Kar , A. Pedro Aguiar , Jaime Ramos

This paper mainly focuses on solving the dynamic optimization of the planar controlled crowd motion models with obstacles which is an application of a class of optimal control problems governed by a general perturbed nonconvex sweeping…

Optimization and Control · Mathematics 2021-04-09 Tan Cao , Boris Mordukhovich , Dao Nguyen , Trang Nguyen

The aim of this paper is to study a wide class of non-convex sweeping processes with moving constraint whose translation and deformation are represented by regulated functions, i.e., functions of not necessarily bounded variation admitting…

Dynamical Systems · Mathematics 2021-01-08 Pavel Krejci , Giselle Antunes Monteiro , Vincenzo Recupero

Given a nonlinear control system, a target set, a nonnegative integral cost, and a continuous function $W$, we say that the system is globally asymptotically controllable to the target with W-regulated cost, whenever, starting from any…

Optimization and Control · Mathematics 2023-06-01 Anna Chiara Lai , Monica Motta

We present an $\tilde{O}(m^{10/7})=\tilde{O}(m^{1.43})$-time algorithm for the maximum s-t flow and the minimum s-t cut problems in directed graphs with unit capacities. This is the first improvement over the sparse-graph case of the…

Data Structures and Algorithms · Computer Science 2013-10-25 Aleksander Madry

In this paper we consider the problem of minimizing functionals of the form $E(u)=\int_B f(x,\nabla u) \,dx$ in a suitably prepared class of incompressible, planar maps $u: B \rightarrow \mathbb{R}^2$. Here, $B$ is the unit disk and…

Analysis of PDEs · Mathematics 2024-09-10 Marcel Dengler , Jonathan J. Bevan
‹ Prev 1 4 5 6 7 8 10 Next ›