arXiv Analytics

Sign in

arXiv:2309.03990 [math.OC]AbstractReferencesReviewsResources

Derivation of Coordinate Descent Algorithms from Optimal Control Theory

I. M. Ross

Published 2023-09-07Version 1

Recently, it was posited that disparate optimization algorithms may be coalesced in terms of a central source emanating from optimal control theory. Here we further this proposition by showing how coordinate descent algorithms may be derived from this emerging new principle. In particular, we show that basic coordinate descent algorithms can be derived using a maximum principle and a collection of max functions as "control" Lyapunov functions. The convergence of the resulting coordinate descent algorithms is thus connected to the controlled dissipation of their corresponding Lyapunov functions. The operational metric for the search vector in all cases is given by the Hessian of the convex objective function.

Related articles: Most relevant | Search more
arXiv:2203.17226 [math.OC] (Published 2022-03-29)
A Derivation of Nesterov's Accelerated Gradient Algorithm from Optimal Control Theory
arXiv:1001.3217 [math.OC] (Published 2010-01-19)
Optimal control theory : a method for the design of wind instruments
arXiv:1704.04895 [math.OC] (Published 2017-04-17)
Markov-Dubins Path via Optimal Control Theory