arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.08500math.OCcs.SYeess.SY
收藏

时变凸优化:时间结构算法及其应用

Time-Varying Convex Optimization: Time-Structured Algorithms and Applications

Andrea Simonetto, Emiliano Dall'Anese, Santiago Paternain, Geert Leus, Georgios B. Giannakis

摘要:

优化是科学和技术每天面临的许多挑战的基础。近年来,基于批量算法的传统优化范式发生了重大转变,用于中等规模的问题,具有挑战性的动态,时变,甚至是巨大的设置。这是由技术变革推动的,这些技术变革将基础设施和社交平台转换为复杂而动态的网络系统,甚至具有普遍的传感和计算能力。本文回顾了广泛的一类国家的最先进的算法随时间变化的优化,着眼于算法的发展和性能分析。它提供了可用工具和方法的全面概述,并揭示了广泛关注的应用领域的开放挑战。所展示的现实世界的例子包括智能电力系统、机器人技术、机器学习和数据分析,突出了特定领域的问题和解决方案。最终目标是使分析工具和相关理论基础的广泛工程相关性得到验证。

英文摘要:

Optimization underpins many of the challenges that science and technology face on a daily basis. Recent years have witnessed a major shift from traditional optimization paradigms grounded on batch algorithms for medium-scale problems to challenging dynamic, time-varying, and even huge-size settings. This is driven by technological transformations that converted infrastructural and social platforms into complex and dynamic networked systems with even pervasive sensing and computing capabilities. The present paper reviews a broad class of state-of-the-art algorithms for time-varying optimization, with an eye to both algorithmic development and performance analysis. It offers a comprehensive overview of available tools and methods, and unveils open challenges in application domains of broad interest. The real-world examples presented include smart power systems, robotics, machine learning, and data analytics, highlighting domain-specific issues and solutions. The ultimate goal is to exempify wide engineering relevance of analytical tools and pertinent theoretical foundations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑