21 April 2020 in IEEE Transactions on Automatic Control
Autonomous optimization refers to the design of feedback controllers that steer a physical system to a steady state that solves a predefined, possibly constrained, optimization problem. As such, no exogenous control inputs such as setpoints or trajectories are required. Instead, these controllers are modeled after optimization algorithms that take the form of dynamical systems. The interconnection of this type of optimization dynamics with a physical system is however not guaranteed to be stable unless both dynamics act on sufficiently different timescales. In this paper, we quantify the required timescale separation and give prescriptions that can be directly used in the design of this type of feedback controllers. Using ideas from singular perturbation analysis, we derive stability bounds for different feedback laws that are based on common continuous-time optimization schemes. In particular, we consider gradient descent and its variations, including projected gradient, and Newton gradient. We further give stability bounds for momentum methods and saddle-point flows. Finally, we discuss how optimization algorithms like subgradient and accelerated gradient descent, while well-behaved in offline settings, are unsuitable for autonomous optimization due to their general lack of robustness.
1 December 2020 in Electric Power Systems Research
1 January 2021 in SIAM Journal on Control and Optimization
Continuous-time projected dynamical systems are an elementary class of discontinuous dynamical systems with trajectories that remain in a feasible domain by means of projecting outward-pointing vec...
21 June 2018 in IEEE Control Systems Letters
Solutions to nonlinear, nonconvex optimization problems can fail to satisfy the KKT optimality conditions even when they are optimal. This is due to the fact that unless constraint qualifications (CQ) are satisfied, Lagrange multipliers may fail to exist. Even if the KKT conditions are applicable, the multipliers may not be unique. These possibilities also affect AC optimal power flow (OPF) problems which are routinely solved in power systems planning, scheduling and operations. The complex structure – in particular the presence of the nonlinear power flow equations which naturally exhibit a structural degeneracy – make any attempt to establish CQs for the entire class of problems very challenging. In this paper, we resort to tools from differential topology to show that for AC OPF problems in various contexts the linear independence constraint qualification is satisfied almost certainly, thus effectively obviating the usual assumption on CQs. Consequently, for any local optimizer there generically exists a unique set of multipliers that satisfy the KKT conditions.