Recently, literature on dynamic coherent risk measures has broadened the choices for risk-sensitive performance evaluation. A running example includes Cumulative prospect theory and Conditional variance at risk. Most of them can be can be interpreted in general as a non-linear transformation of a given random variable. Non-convexity property has implied a lot of mathematical intricacies and challenges. The paper gives overview on the recent development of dynamic programming optimal control optimization problems driven by non-convex measures.
Uncertainties from deepening penetration of renewable energy resources have posed critical challenges to the secure and reliable operations of future electric grids. Among various approaches for decision making in uncertain environments, this paper focuses on chance-constrained optimization, which provides explicit probabilistic guarantees on the feasibility of optimal solutions. Although quite a few methods have been proposed to solve chance-constrained optimization problems, there is a lack of comprehensive review and comparative analysis of the proposed methods. Part I of this two-part pape…
We consider the stochastic optimal control problem for the dynamical system of the stochastic differential equation driven by a local martingale with a spatial parameter. Assuming the convexity of the control domain, we obtain the stochastic maximum principle as the necessary condition for an optimal control, and we also prove its sufficiency under proper conditions. The stochastic linear quadratic problem in this setting is also discussed.
In this paper, we consider the stochastic optimal control problems under model risk caused by uncertain volatilities. To have a mathematical consistent framework we use the notion of G-expectation and its corresponding G-Brwonian motion introduced by Peng(2007). Based on the theory of stochastic differential equations on a sublinear expectation space $(Ω,\mathcal{H},\hat{\mathbb{E}})$, we prove a stochastic maximum principle for controlled processes driven by G-Brownian motion. Then we obtain the maximum condition in terms of the $\mathcal{H}$-function plus some convexity conditions constitute…
In this paper, we exploit the so-called value function reformulation of the bilevel optimization problem to develop duality results for the problem. Our approach builds on Fenchel-Lagrange-type duality to establish suitable results for the bilevel optimization problem. First, we overview some standard duality results to show that they are not applicable to our problem. Secondly, via the concept of partial calmness, we establish weak and strong duality results. In particular, Lagrange, Fenchel-Lagrange, and Toland-Fenchel- Lagrange duality concepts are investigated for this type of problems und…
In a Hilbert setting, we develop fast methods for convex unconstrained optimization. We rely on the asymptotic behavior of an inertial system combining geometric damping with temporal scaling. The convex function to minimize enters the dynamic via its gradient. The dynamic includes three coefficients varying with time, one is a viscous damping coefficient, the second is attached to the Hessian-driven damping, the third is a time scaling coefficient. We study the convergence rate of the values under general conditions involving the damping and the time scale coefficients. The obtained results a…
In a Hilbert setting, for convex differentiable optimization, we consider accelerated gradient dynamics combining Tikhonov regularization with Hessian-driven damping. The Tikhonov regularization parameter is assumed to tend to zero as time tends to infinity, which preserves equilibria. The presence of the Tikhonov regularization term induces a strong convexity property which vanishes asymptotically. To take advantage of the exponential convergence rates attached to the heavy ball method in the strongly convex case, we consider the inertial dynamic where the viscous damping coefficient is taken…
The study of robotic flocking has received considerable attention in the past twenty years. As we begin to deploy flocking control algorithms on physical multi-agent and swarm systems, there is an increasing necessity for rigorous promises on safety and performance. In this paper, we present an overview the literature focusing on optimization approaches to achieve flocking behavior that provide strong safety guarantees. We separate the literature into cluster and line flocking, and categorize cluster flocking with respect to the system-level objective, which may be realized by a reactive or pl…
In many optimization problems arising from scientific, engineering and artificial intelligence applications, objective and constraint functions are available only as the output of a black-box or simulation oracle that does not provide derivative information. Such settings necessitate the use of methods for derivative-free, or zeroth-order, optimization. We provide a review and perspectives on developments in these methods, with an emphasis on highlighting recent developments and on unifying treatment of such problems in the non-linear optimization and machine learning literature. We categorize…
Institute of Control Sciences RAS（俄罗斯科学院控制科学研究所）；Moscow Institute of Physics and Technology（莫斯科物理技术学院）；Weierstrass Institute for Applied Analysis and Stochastics（魏尔斯特拉斯应用分析与随机研究所）；HSE University（高等经济学院）；Institute for Information Transmission Problems RAS（俄罗斯科学院信息传输问题研究所）；Mohamed bin Zayed University of Artificial Intelligence（穆罕默德·本·扎耶德人工智能大学）
Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical results on global performance guarantees of optimization algorithms for non-convex optimization. We start with classical arguments showing that general non-convex problems could not be solved efficiently in a reasonable time. Then we give a list of problems that can be solved efficiently to find the global minimizer by exploiting the structure of the problem as mu…
We consider a control problem where the system is driven by a decoupled as well as a coupled forward-backward stochastic differential equation. We prove the existence of an optimal control in the class of relaxed controls, which are measure-valued processes, generalizing the usual strict controls. The proof is based on some tightness properties and weak convergence on the space D of càdlàg functions, endowed with the Jakubowsky S-topology. Moreover, under some convexity assumptions, we show that the relaxed optimal control is realized by a strict control.
In this contribution, we discuss the modeling and model reduction framework known as the Loewner framework. This is a data-driven approach, applicable to large-scale systems, which was originally developed for applications to linear time-invariant systems. In recent years, this method has been extended to a number of additional more complex scenarios, including linear parametric or nonlinear dynamical systems. We will provide here an overview of the latter two, together with time-domain extensions. Additionally, the application of the Loewner framework is illustrated by a collection of practic…
