关键词：编码；凸优化问题；模拟电路
摘 要：Advances in algorithms and coding have made the convergence time of a convex optimization problem reasonable for real-time optimization applications. However, solving convex optimization problems within a microsecond is still challenging, especially for larger sized problems. In addition, due to Moore's Law slowing down, the speed of modern processors is not improving at a signifi cant rate. Many applications use parallelization in an e ort to continue solving problems faster. However, this method is not e ffective for all convex optimization problems as it may require iterations to reach a solution, e ffectively increasing latency.