Related papers: Quantitative Stability of Linear Infinite Inequali…

While neural networks can enjoy an outstanding flexibility and exhibit unprecedented performance, the mechanism behind their behavior is still not well-understood. To tackle this fundamental challenge, researchers have tried to restrict and…

Chance-constrained programming is a widely used framework for decision-making under uncertainty, yet its mixed-integer reformulations involve nonconvex mixing sets with a knapsack constraint, leading to weak relaxations and computational…

Controlling the dispersion of a subset of decision variables in an optimization problem is crucial for enforcing fairness or load-balancing across a wide range of applications. Building on the well-known equivalence of finite-dimensional…

We consider a class of inverse problems defined by a nonlinear map from parameter or model functions to the data. We assume that solutions exist. The space of model functions is a Banach space which is smooth and uniformly convex; however,…

We study the inverse boundary value problem for the Helmholtz equation using the Dirichlet-to-Neumann map at selected frequency as the data. We develop an explicit reconstruction of the wavespeed using a multi-level nonlinear projected…

If a differential equation in a Banach manifold is invariant or quasi-invariant under the action of one or more Lie groups, then its stationary points cannot be isolated, so that classical linearized stability theorem does not apply to it.…

Most inverse optimization models impute unspecified parameters of an objective function to make an observed solution optimal for a given optimization problem with a fixed feasible set. We propose two approaches to impute unspecified…

We derive parameter-robust quasi-optimal error estimates for mixed finite element methods for the nonlinear Darcy--Forchheimer equations with mixed boundary conditions. Using the framework of operator preconditioning, we also design…

This paper presents a novel methodology for evaluating the boundedness, stability, and instability of some vector nonlinear systems with multiple time-varying delays and variable coefficients. The proposed technique develops two scalar…

Quadratic systems with lossless quadratic terms arise in many applications, including models of atmosphere and incompressible fluid flows. Such systems have a trapping region if all trajectories eventually converge to and stay within a…

This paper proposes a new test for inequalities that are linear in possibly partially identified nuisance parameters. This type of hypothesis arises in a broad set of problems, including subvector inference for linear unconditional moment…

In this paper, we consider integral linear constraints and the dissipation inequality with linear supply rates for certain sets of trajectories confined pointwise in time to a convex cone which belongs to a finite-dimensional normed vector…

This paper presents a novel robust trajectory optimization method for constrained nonlinear dynamical systems subject to unknown bounded disturbances. In particular, we seek optimal control policies that remain robustly feasible with…

We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove…

In this paper, we systematically study the regularity theory of the linear system of nearly incompressible elasticity. In the setting of stochastic homogenization, we develop new techniques to establish the large-scale estimates of…

We consider the problem of finite-horizon optimal control design under uncertainty for imperfectly observed discrete-time systems with convex costs and constraints. It is known that this problem can be cast as an infinite-dimensional convex…

The existence of a Banach limit as a translation invariant positive continuous linear functional on the space of bounded scalar sequences which is equal to 1 at the constant sequence (1,1,...,1,...) is proved in a first course on functional…

We consider the minimization of a sum of an expectation-valued coordinate-wise $L_i$-smooth nonconvex function and a nonsmooth block-separable convex regularizer. We propose an asynchronous variance-reduced algorithm, where in each…

This paper considers stochastic weakly convex optimization without the standard Lipschitz continuity assumption. Based on new adaptive regularization (stepsize) strategies, we show that a wide class of stochastic algorithms, including the…

We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…