arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.01506math.OCcs.NAmath.NA
收藏

水平集方法用于凸优化

Level-set methods for convex optimization

University of Washington(华盛顿大学);UC Davis(加州大学戴维斯分校)

Aleksandr Y. Aravkin, James V. Burke, Dmitriy Drusvyatskiy, Michael P. Friedlander, Scott Roy

AI总结:

本文提出一种将目标函数与约束函数角色互换的水平集方法,用于求解具有复杂约束的凸优化问题,适用于低秩半正定优化、稀疏优化和广义线性模型。

摘要:

应用中出现的凸优化问题通常具有有利的目标函数和复杂的约束,这使得一阶方法无法立即应用。我们描述了一种方法,通过交换目标和约束函数的角色,近似求解一系列参数化的水平集问题。基于不精确函数评估和可能不精确的导数信息的零寻找过程,导致了原始问题的有效求解方案。我们描述了该方法在广泛问题中的理论和实际性质,包括低秩半正定优化、稀疏优化和用于推断的广义线性模型。

英文摘要:

Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the roles of the objective and constraint functions, and instead approximately solves a sequence of parametric level-set problems. A zero-finding procedure, based on inexact function evaluations and possibly inexact derivative information, leads to an efficient solution scheme for the original problem. We describe the theoretical and practical properties of this approach for a broad range of problems, including low-rank semidefinite optimization, sparse optimization, and generalized linear models for inference.

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

↑