Mathematics - Optimization and Control Publications (50)

Search

Mathematics - Optimization and Control Publications

This article presents a framework and develops a formulation to solve a path planning problem for multiple heterogeneous Unmanned Vehicles (UVs) with uncertain service times for each vehicle--target pair. The vehicles incur a penalty proportional to the duration of their total service time in excess of a preset constant. The vehicles differ in their motion constraints and are located at distinct depots at the start of the mission. Read More


Heat fluxes in a district heating pipeline systems need to be controlled on the scale from minutes to an hour to adjust to evolving demand. There are two principal ways to control the heat flux - keep temperature fixed but adjust velocity of the carrier (typically water) or keep the velocity flow steady but then adjust temperature at the heat producing source (heat plant). We study the latter scenario, commonly used for operations in Russia and Nordic countries, and analyze dynamics of the heat front as it propagates through the system. Read More


In a bounded domain of $\mathbb{R}^n$ with smooth boundary, we study the regularity of the viscosity solution, $T$, of the Dirichlet problem for the eikonal equation associated with a family of smooth vector fields $\{X_1,\ldots ,X_N\}$, subject to H\"ormander's bracket generating condition. Due to the presence of characteristic boundary points, singular trajectories may occur in this case. We characterize such trajectories as the closed set of all points at which the solution loses point-wise Lipschitz continuity. Read More


In this paper, we propose a model of decentralized energy storages, who serve as instruments to shift energy supply intertemporally. From storages' perspective, we investigate their optimal buying or selling decisions under market uncertainty. The goal of this paper is to understand the economic value of future market information, as energy storages mitigate market uncertainty by forward-looking strategies. Read More


This paper studies stability analysis of DC microgrids with uncertain constant power loads (CPLs). It is well known that CPLs have negative impedance effects, which may cause instability in a DC microgrid. Existing works often study the stability around a given equilibrium based on some nominal values of CPLs. Read More


The differential-geometric structure of certain shape spaces is investigated and applied to the theory of shape optimization problems constrained by partial differential equations and variational inequalities. Furthermore, we define a diffeological structure on a new space of so-called $H^{1/2}$-shapes. This can be seen as a first step towards the formulation of optimization techniques on diffeological spaces. Read More


Optimal control problems involving hybrid binary-continuous control costs are challenging due to their lack of convexity and weak lower semicontinuity. Replacing such costs with their convex relaxation leads to a primal-dual optimality system that allows an explicit pointwise characterization and whose Moreau-Yosida regularization is amenable to a semismooth Newton method in function space. This approach is especially suited for computing switching controls for partial differential equations. Read More


Optimal control problems without control costs in general do not possess solutions due to the lack of coercivity. However, unilateral constraints together with the assumption of existence of strictly positive solutions of a pre-adjoint state equation, are sufficient to obtain existence of optimal solutions in the space of Radon measures. Optimality conditions for these generalized minimizers can be obtained using Fenchel duality, which requires a non-standard perturbation approach if the control-to-observation mapping is not continuous (e. Read More


This work is concerned with optimal control of partial differential equations where the control enters the state equation as a coefficient and should take on values only from a given discrete set of values corresponding to available materials. A "multi-bang" framework based on convex analysis is proposed where the desired piecewise constant structure is incorporated using a convex penalty term. Together with a suitable tracking term, this allows formulating the problem of optimizing the topology of the distribution of material parameters as minimizing a convex functional subject to a (nonlinear) equality constraint. Read More


A convex penalty for promoting switching controls for partial differential equations is introduced; such controls consist of an arbitrary number of components of which at most one should be simultaneously active. Using a Moreau-Yosida approximation, a family of approximating problems is obtained that is amenable to solution by a semismooth Newton method. The efficiency of this approach and the structure of the obtained controls are demonstrated by numerical examples. Read More


RF pulse design via optimal control is typically based on gradient and quasi-Newton approaches and therefore suffers from slow convergence. We present a flexible and highly efficient method that uses exact second-order information within a globally convergent trust-region CG-Newton method to yield an improved convergence rate. The approach is applied to the design of RF pulses for single- and simultaneous multi-slice (SMS) excitation and validated using phantom and in-vivo experiments on a 3T scanner using a modified gradient echo sequence. Read More


We study controllability of a Partial Differential Equation of transport type, that arises in crowd models. We are interested in controlling such system with a control being a Lipschitz vector field on a fixed control set $\omega$. We prove that, for each initial and final configuration, one can steer one to another with such class of controls only if the uncontrolled dynamics allows to cross the control set $\omega$. Read More


A preconditioning strategy for the Powell-Hestenes-Rockafellar Augmented Lagrangian method (ALM) is presented. The scheme exploits the structure of the Augmented Lagrangian Hessian. It is a modular preconditioner consisting of two blocks. Read More


We prove a strong duality result for a linear programming problem which has the interpretation of being a discretised optimal Skorokhod embedding problem, and we recover this continuous time problem as a limit of the discrete problems. With the discrete setup we show that for a suitably chosen objective function, the optimiser takes the form of a hitting time for a random walk. In the limiting problem we then reprove the existence of the Root, Rost, and cave embedding solutions of the Skorokhod embedding problem. Read More


Integration of plug-in electric vehicles (PEVs) with distributed renewable resources will decrease PEVs' well-to-wheels greenhouse gas emissions, promote renewable power adoption and defer power system investments. This paper proposes a multidisciplinary approach to jointly planning PEV fast-charging stations and distributed photovoltaic (PV) power plants on coupled transportation and power networks. First, we develop models of 1) PEV fast-charging stations; 2) highway transportation networks under PEV driving range constraints; 3) PV power plants with reactive power control. Read More


This work proposes a research problem of finding sparse solution of undetermined Linear system with some applications. Two approaches how to solve the compressive sensing problem: using l_1 approach , the l_q approach with 0 < q < 1. Compressive sensing algorithms are designed to cope with ambiguities introduced by undersampling. Read More


We discuss the government's reward and penalty mechanism in the presence of asymmetric information and carbon emission constraint when downstream retailers compete in a reverse supply chain network. Considering five game models which are different in terms of the coordination structure of the reverse supply chain network and power structure of the reward-penalty mechanism: (1) the reverse supply chain network centralized decision-making model; (2) the reverse supply chain network centralized decision-making model with carbon emission constraint; (3) the retailers' competition reverse supply chain network decentralized decision-making model; (4) the retailers' competition reverse supply chain network decentralized decision-making model with carbon emission constraint; (5) the retailers' competition reverse supply chain network decentralized decision-making model with carbon emission constraint and the government's reward-penalty mechanism. Building the participation-incentive contract under each model use the principal-agent theory, and solving the model use the Lagrange multiplier method. Read More


How can we approach the truth in a society? It may depend on various factors. In this paper, using a well-established truth seeking model, we show that the persistent free information flow will bring us to the truth. Here the free information flow is modeled as the environmental random noise that could alter one's cognition. Read More


A Learning Model Predictive Controller (LMPC) for linear system in presented. The proposed controller is an extension of the LMPC [1] and it aims to decrease the computational burden. The control scheme is reference-free and is able to improve its performance by learning from previous iterations. Read More


We study the online constrained ranking problem motivated by an application to web-traffic shaping: an online stream of sessions arrive in which, within each session, we are asked to rank items. The challenge involves optimizing the ranking in each session so that local vs. global objectives are controlled: within each session one wishes to maximize a reward (local) while satisfying certain constraints over the entire set of sessions (global). Read More


The paper defines a family of nested non-cooperative simultaneous finite games to study coalition structure formation with intra and inter-coalition externalities. Every game has two outcomes - an allocation of players over coalitions and a payoff profile for every player. Every game in the family has an equilibrium in mixed strategies. Read More


We consider the problem of bandit optimization, inspired by stochastic optimization and online learning problems with bandit feedback. In this problem, the objective is to minimize a global loss function of all the actions, not necessarily a cumulative loss. This framework allows us to study a very general class of problems, with applications in statistics, machine learning, and other fields. Read More


We consider 2-player zero-sum stochastic games where each player controls his own state variable living in a compact metric space. The terminology comes from gambling problems where the state of a player represents its wealth in a casino. Under natural assumptions (such as continuous running payoff and non expansive transitions), we consider for each discount factor the value v $\lambda$ of the $\lambda$-discounted stochastic game and investigate its limit when $\lambda$ goes to 0. Read More


This paper concerns a fundamental class of convex matrix optimization problems. It presents the first algorithm that uses optimal storage and provably computes a low-rank approximation of a solution. In particular, when all solutions have low rank, the algorithm converges to a solution. Read More


In this paper we solve the problem of the identification of a coefficient which appears in the model of a distributed system with persistent memory encountered in linear viscoelasticity (and in diffusion processes with memory). The additional data used in the identification are subsumed in the input output map from the deformation to the traction on the boundary. We extend a dynamical approach to identification introduced by Belishev in the case of purely elastic (memoryless) bodies and based on a special equation due to Blagoveshchenskii. Read More


We show that accelerated optimization methods can be seen as particular instances of multi-step integration schemes from numerical analysis, applied to the gradient flow equation. In comparison with recent advances in this vein, the differential equation considered here is the basic gradient flow and we show that multi-step schemes allow integration of this differential equation using larger step sizes, thus intuitively explaining acceleration results. Read More


For each integer $n$ we present an explicit formulation of a compact linear program, with $O(n^3)$ variables and constraints, which determines the satisfiability of any 2SAT formula with $n$ boolean variables by a single linear optimization. This contrasts with the fact that the natural polytope for this problem, formed from the convex hull of all satisfiable formulas and their satisfying assignments, has superpolynomial extension complexity. Our formulation is based on multicommodity flows. Read More


The short-term voltage stability (SVS) problem in large-scale receiving-end power systems is serious due to the increasing load demand, the increasing use of electronically controlled loads and so on. Some serious blackouts are considered to be related to short-term voltage instability. In China, the East China Grid (ECG) is especially vulnerable to short-term voltage instability due the its increasing dependence on power injection from external grids through HVDC links. Read More


In this paper, we obtain global $\mathcal{O} (1/ \sqrt{k})$ pointwise and $\mathcal{O} (1/ {k})$ ergodic convergence rates for a variable metric proximal alternating direction method of multipliers(VM-PADMM) for solving linearly constrained convex optimization problems. The VM-PADMM can be seen as a class of ADMM variants, allowing the use of degenerate metrics (defined by noninvertible linear operators). We first propose and study nonasymptotic convergence rates of a variable metric hybrid proximal extragradient (VM-HPE) framework for solving monotone inclusions. Read More


This letter provides conditions determining the rank of the nodal admittance matrix, and arbitrary block partitions of it, for connected AC power networks with complex admittances. Furthermore, some implications of these properties concerning Kron Reduction and Hybrid Network Parameters are outlined. Read More


This paper studies an electricity market consisting of an independent system operator (ISO) and a group of generators. The goal is to solve the DC optimal power flow (DC-OPF) problem: have the generators collectively meet the power demand while minimizing the aggregate generation cost and respecting line flow limits in the network. The ISO by itself cannot solve the DC-OPF problem as generators are strategic and do not share their cost functions. Read More


This paper is concerned with the filtering problem in continuous-time. Three algorithmic solution approaches for this problem are reviewed: (i) the classical Kalman-Bucy filter which provides an exact solution for the linear Gaussian problem, (ii) the ensemble Kalman-Bucy filter (EnKBF) which is an approximate filter and represents an extension of the Kalman-Bucy filter to nonlinear problems, and (iii) the feedback particle filter (FPF) which represents an extension of the EnKBF and furthermore provides for a consistent solution in the general nonlinear, non-Gaussian case. The common feature of the three algorithms is the gain times error formula to implement the update step (to account for conditioning due to observations) in the filter. Read More


We consider a multidimensional stochastic differential game that emerges from a multiclass M/M/1 queueing problem under heavy-traffic with model uncertainty. Namely, it is assumed that the decision maker is uncertain about the rates of arrivals to the system and the rates of service and acts to optimize an overall cost that accounts for this uncertainty. We show that the multidimensional game can be reduced to a one-dimensional stochastic differential game. Read More


This study introduces a procedure to obtain general expressions, $y = f(x)$, subject to linear constraints on the function and its derivatives defined at specified values. These \emph{constrained expressions} can be used describe functions with embedded specific constraints. The paper first shows how to express the most general explicit function passing through a single point in three distinct ways: linear, additive, and rational. Read More


We consider the minimization of composite objective functions composed of the expectation of quadratic functions and an arbitrary convex function. We study the stochastic dual averaging algorithm with a constant step-size, showing that it leads to a convergence rate of O(1/n) without strong convexity assumptions. This thus extends earlier results on least-squares regression with the Euclidean geometry to (a) all convex regularizers and constraints, and (b) all geome-tries represented by a Bregman divergence. Read More


We propose an intelligent proactive content caching scheme to reduce the energy consumption in wireless downlink. We consider an online social network (OSN) setting where new contents are generated over time, and remain \textit{relevant} to the user for a random lifetime. Contents are downloaded to the user equipment (UE) through a time-varying wireless channel at an energy cost that depends on the channel state and the number of contents downloaded. Read More


A method is devised for numerically solving a class of finite-horizon optimal control problems subject to cascade linear discrete-time dynamics. It is assumed that the linear state and input inequality constraints, and the quadratic measure of performance, are all separable with respect to the spatial dimension of the underlying cascade of sub-systems, as well as the temporal dimension of the dynamics. By virtue of this structure, the computation cost of an interior-point method for an equivalent quadratic programming formulation of the optimal control problem can be made to scale linearly with the number of sub-systems. Read More


We study the problem of online learning in a class of Markov decision processes known as linearly solvable MDPs. In the stationary version of this problem, a learner interacts with its environment by directly controlling the state transitions, attempting to balance a fixed state-dependent cost and a certain smooth cost penalizing extreme control inputs. In the current paper, we consider an online setting where the state costs may change arbitrarily between consecutive rounds, and the learner only observes the costs at the end of each respective round. Read More


We show that practical uniform global asymptotic stability (pUGAS) is equivalent to existence of a bounded uniformly globally weakly attractive set. This result is valid for a wide class of robustly forward complete distributed parameter systems, including time-delay systems, switched systems, many classes of PDEs and evolution differential equations in Banach spaces. We apply this criterion to show that existence of a non-coercive Lyapunov function ensures pUGAS of robustly forward complete systems. Read More


We introduce a notion of matrix valued Gram decompositions for correlation matrices whose study is motivated by quantum information theory. We show that for extremal correlations, the matrices in such a factorization generate a Clifford algebra and thus, their size is exponential in terms of the rank of the correlation matrix. Using this we give a self-contained and succinct proof of the existence of completely positive semidefinite matrices with sub-exponential cpsd-rank, recently derived in the literature. Read More


Given $\rho \in P(R^d)$, we prove that, if the concentration of $\rho$ is less than $1/2$, then it has finite 2-particles Coulomb cost. The result is sharp, in the sense that there exists $\rho$ with concentration 1/2 for which $C(\rho) = \infty$. Read More


The minimum volume enclosing ellipsoid (MVEE) problem is an optimization problem in the basis of many practical problems. This paper describes some new properties of this model and proposes a first-order oracle algorithm, the Adjusted Coordinate Descent (ACD) algorithm, to address the MVEE problem. The ACD algorithm is globally linear convergent and has an overwhelming advantage over the other algorithms in cases where the dimension of the data is large. Read More


This paper considers the problem of implementing a previously proposed distributed direct coupling quantum observer for a closed linear quantum system. By modifying the form of the previously proposed observer, the paper proposes a possible experimental implementation of the observer plant system using a non-degenerate parametric amplifier and a chain of optical cavities which are coupled together via optical interconnections. It is shown that the distributed observer converges to a consensus in a time averaged sense in which an output of each element of the observer estimates the specified output of the quantum plant. Read More


We find previously unknown families which imply Frankl's conjecture for all families that contain them using an algorithmic framework. The conjecture states that for any non-empty union-closed (UC) family there exists an element in at least half of the sets. Poonen's Theorem characterizes the existence of weights which determine whether a given UC family implies the conjecture for all UC families which contain it. Read More


We derive an explicit formula, as well as an efficient procedure, for constructing a generalized Jacobian for the projector of a given square matrix onto the Birkhoff polytope, i.e., the set of doubly stochastic matrices. Read More


Some variational problems for a Foppl-von Karman plate subject to general equilibrated loads are studied. The existence of global minimizers is proved under the assumption that the out-of-plane displacement fulfils homogeneous Dirichlet condition on the whole boundary while the in-plane displacement fulfils nonhomogeneous Neumann condition. If the Dirichlet condition is prescribed only on a subset of the boundary, then the energy may be unbounded from below over the set of admissible configurations, as shown by several explicit conterexamples: in these cases the analysis of critical points is addressed through an asymptotic development of the energy functional in a neighborhood of the flat configuration. Read More


In this paper, we provide a complete characterization on the robust isolated calmness of the Karush-Kuhn-Tucker (KKT) solution mapping for convex constrained optimization problems regularized by the nuclear norm function. This study is motivated by the recent work in [8], where the authors show that under the Robinson constraint qualification at a local optimal solution, the KKT solution mapping for a wide class of conic programming problem is robustly isolated calm if and only if both the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) are satisfied. Based on the variational properties of the nuclear norm function and its conjugate, we establish the equivalence between the primal/dual SOSC and the dual/primal SRCQ. Read More


In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as optimization over polynomials. To avoid the problem of intractability, we establish a trade off between accuracy and complexity. Read More