BriefGPT.xyz
Jun, 2023
基于递归割平面法的内存受限凸优化算法
Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes
HTML
PDF
Moïse Blanchard, Junhui Zhang, Patrick Jaillet
TL;DR
我们提出了一系列递归割平面算法,用于解决具有受限内存的可行性问题,这些算法可以用于一阶凸优化。
Abstract
We propose a family of recursive
cutting-plane algorithms
to solve feasibility problems with constrained memory, which can also be used for first-order
convex optimization
. Precisely, in order to find a point wit
→