A Global Approach for Solving Edge-Matching Puzzles

We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this problem and provide conditions under which it exactly characterizes a puzzle. Using the new representation, we recast the combinatorial, discrete problem of solving puzzles as a global, polynomial system of equations with continuous variables. We further propose new algorithms for generating approximate solutions to the continuous problem by solving a sequence of convex relaxations

Conic Optimization Theory: Convexification Techniques and Numerical Algorithms

Optimization is at the core of control theory and appears in several areas of this field, such as optimal control, distributed control, system identification, robust control, state estimation, model predictive control and dynamic programming. The recent advances in various topics of modern optimization have also been revamping the area of machine learning. Motivated by the crucial role of optimization theory in the design, analysis, control and operation of real-world systems, this tutorial paper offers a detailed overview of some major advances in this area, namely conic optimization and its emerging applications. First, we discuss the importance of conic optimization in different areas. Then, we explain seminal results on the design of hierarchies of convex relaxations for a wide range of nonconvex problems. Finally, we study different numerical algorithms for large-scale conic optimization problems.Comment: 18 page

Synchronization-Aware and Algorithm-Efficient Chance Constrained Optimal Power Flow

One of the most common control decisions faced by power system operators is the question of how to dispatch generation to meet demand for power. This is a complex optimization problem that includes many nonlinear, non convex constraints as well as inherent uncertainties about future demand for power and available generation. In this paper we develop convex formulations to appropriately model crucial classes of nonlinearities and stochastic effects. We focus on solving a nonlinear optimal power flow (OPF) problem that includes loss of synchrony constraints and models wind-farm caused fluctuations. In particular, we develop (a) a convex formulation of the deterministic phase-difference nonlinear Optimum Power Flow (OPF) problem; and (b) a probabilistic chance constrained OPF for angular stability, thermal overloads and generation limits that is computationally tractable.Comment: 11 pages, 3 figure

Constrained nonlinear optimal control: a converse HJB approach

Extending the concept of solving the Hamilton-Jacobi-Bellman (HJB) optimization equation backwards [2], the so called converse constrained optimal control problem is introduced, and used to create various classes of nonlinear systems for which the optimal controller subject to constraints is known. In this way a systematic method for the testing, validation and comparison of different control techniques with the optimal is established. Because it naturally and explicitly handles constraints, particularly control input saturation, model predictive control (MPC) is a potentially powerful approach for nonlinear control design. However, nonconvexity of the nonlinear programs (NLP) involved in the MPC optimization makes the solution problematic. In order to explore properties of MPC-based constrained control schemes, and to point out the potential issues in implementing MPC, challenging benchmark examples are generated and analyzed. Properties of MPC-based constrained techniques are then evaluated and implementation issues are explored by applying both nonlinear MPC and MPC with feedback linearization