Related papers: A convex optimization approach to the Lyapunov exp…
We propose to solve polynomial hyperbolic partial differential equations (PDEs) with convex optimization. This approach is based on a very weak notion of solution of the nonlinear equation, namely the measure-valued (mv) solution,…
We propose a convex-optimization-based framework for computation of invariant measures of polynomial dynamical systems and Markov processes, in discrete and continuous time. The set of all invariant measures is characterized as the feasible…
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optimization. We introduce the notion of a Lagrangian dual…
An important concept of convexificators has been extended to Hadamard manifolds in this paper. The mean value theorem for convexificators on the Hadamard manifold has also been derived. Monotonicity of the bounded convexificators has been…
This paper studies the problem of distributed Riemannian optimization over a network of agents whose cost functions are geodesically smooth but possibly geodesically non-convex. Extending a well-known distributed optimization strategy…
We propose new continuous-time formulations for first-order stochastic optimization algorithms such as mini-batch gradient descent and variance-reduced methods. We exploit these continuous-time models, together with simple Lyapunov analysis…
Two approaches are presented for computing upper bounds on Lyapunov exponents and their sums, and on the Lyapunov dimension, among all trajectories of a dynamical system governed by ordinary differential equations. The first approach…
In this work, the problem of optimizing damper positions in vibrational systems is investigated. The objective is to determine the positions of external dampers in such a way that the influence of the input on the output is minimized. The…
We describe a method, using periodic points and determinants, for giving alternative expressions for dynamical quantities (including Lyapunov exponents and Hausdorff dimension of invariant sets) associated to analytic hyperbolic systems.…
This paper examines a variety of classical optimization problems, including well-known minimization tasks and more general variational inequalities. We consider a stochastic formulation of these problems, and unlike most previous work, we…
Recently, a new algorithm for the computation of covariant Lyapunov vectors and of corresponding local Lyapunov exponents has become available. Here we study the properties of these still unfamiliar quantities for a number of simple models,…
In this paper we study a second order dynamical system with variable coefficients in connection to the minimization problem of a smooth nonconvex function. The convergence of the trajectories generated by the dynamical system to a critical…
In this manuscript, we consider finitely many maps, all of which are defined on a smooth compact measure space, with at least one map in the collection having degree strictly bigger than 1. Working with random dynamics generated by this…
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
Graphical continuous Lyapunov models offer a new perspective on modeling causally interpretable dependence structure in multivariate data by treating each independent observation as a one-time cross-sectional snapshot of a temporal process.…
The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…
We provide a new proof of the linear convergence of the alternating direction method of multipliers (ADMM) when one of the objective terms is strongly convex. Our proof is based on a framework for analyzing optimization algorithms…
We introduce a novel approach addressing global analysis of a difficult class of nonconvex-nonsmooth optimization problems within the important framework of Lagrangian-based methods. This genuine nonlinear class captures many problems in…
This paper deals with a Tikhonov regularized second-order plus first-order primal-dual dynamical system with time scaling for separable convex optimization problems with linear equality constraints. This system consists of two second-order…
Suppose that $\ff \in \reals^{n}$ is a vector of $n$ error-contaminated measurements of $n$ smooth values measured at distinct and strictly ascending abscissae. The following projective technique is proposed for obtaining a vector of smooth…