Related papers: A convex optimization approach to the Lyapunov exp…
This paper studies convex quadratic minimization problems in which each continuous variable is coupled with a binary indicator variable. We focus on the structured setting where the Hessian matrix of the quadratic term is positive definite…
This paper initiates a systematic development of a theory of non-commutative optimization. It aims to unify and generalize a growing body of work from the past few years which developed and analyzed algorithms for natural geodesically…
Convergence analysis of accelerated first-order methods for convex optimization problems are presented from the point of view of ordinary differential equation solvers. A new dynamical system, called Nesterov accelerated gradient flow, has…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
The Riemannian manifold of curves with a Sobolev metric is an important and frequently studied model in the theory of shape spaces. Various numerical approaches have been proposed to compute geodesics, but so far elude a rigorous…
We carry out extensive computer simulations to study the Lyapunov instability of a two-dimensional hard disk system in a rectangular box with periodic boundary conditions. The system is large enough to allow the formation of Lyapunov modes…
In this paper, we consider the data-driven discovery of stable dynamical models with a single equilibrium. The proposed approach uses a basis-function parameterization of the differential equations and the associated Lyapunov function. This…
We characterize geometrically the Lyapunov exponents of a cocycle (of arbitrary rank) with respect to a harmonic current defined on a hyperbolic Riemann surface lamination. Our characterizations are formulated in terms of the expansion…
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…
Smoothing accelerated gradient methods achieve faster convergence rates than that of the subgradient method for some nonsmooth convex optimization problems. However, Nesterov's extrapolation may require gradients at infeasible points, and…
This paper considers time-average optimization, where a decision vector is chosen every time step within a (possibly non-convex) set, and the goal is to minimize a convex function of the time averages subject to convex constraints on these…
Covariant vectors, Lyapunov vectors, or Oseledets vectors are increasingly being used for a variety of model analyses in areas such as partial differential equations, nonautonomous differentiable dynamical systems, and random dynamical…
This paper is motivated by the limit load, limit analysis and shear strength reduction methods, which are commonly employed in geotechnical stability analysis or similar applications. The aim is to make these methods more approachable by…
Second order Sobolev metrics on the space of regular unparametrized planar curves have several desirable completeness properties not present in lower order metrics, but numerics are still largely missing. In this paper, we present…
We introduce a novel primal-dual flow for affine constrained convex optimization problems. As a modification of the standard saddle-point system, our primal-dual flow is proved to possess the exponential decay property, in terms of a…
We introduce a unified framework for computing approximately-optimal preconditioners for solving linear and non-linear systems of equations. We demonstrate that the condition number minimization problem, under structured transformations…
In this work, we study optimization problems of the form $\min_x \max_y f(x, y)$, where $f(x, y)$ is defined on a product Riemannian manifold $\mathcal{M} \times \mathcal{N}$ and is $\mu_x$-strongly geodesically convex (g-convex) in $x$ and…
We consider discretized two-dimensional PDE-constrained shape optimization problems, in which shapes are represented by triangular meshes. Given the connectivity, the space of admissible vertex positions was recently identified to be a…
We consider one-step cocycles of $2 \times 2$ matrices, and we are interested in their Lyapunov-optimizing measures, i.e., invariant probability measures that maximize or minimize a Lyapunov exponent. If the cocycle is dominated, that is,…
Covariant Lyapunov vectors (CLVs) are intrinsic modes that describe long-term linear perturbations of solutions of dynamical systems. With recent advances in the context of semi-invertible multiplicative ergodic theorems, existence of CLVs…