.png){kind=icon}
返回
Augmented Lagrangian optimization under fixed-point arithmetic
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2020.109218.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose an inexact Augmented Lagrangian Method (ALM) for the optimization of convex and nonsmooth objective functions subject to linear equality constraints and box constraints where errors are due to fixed-point data. To prevent data overflow we also introduce a projection operation in the multiplier update. We analyze theoretically the proposed algorithm and provide convergence rate results and bounds on the accuracy of the optimal solution. Since iterative methods are often needed to solve the primal subproblem in ALM, we also propose an early stopping criterion that is simple to implement on embedded platforms, can be used for problems that are not strongly convex, and guarantees the precision of the primal update. To the best of our knowledge, this is the first fixed-point ALM that can handle non-smooth problems, data overflow, and can efficiently and systematically utilize iterative solvers in the primal update. Numerical simulation studies on a logistic regression problem are presented that illustrate the proposed method. (c) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Convex optimization
Augmented Lagrangian Method
Embedded systems
Fixed-point arithmetic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
Sunitinib-Induced Autoimmune Thyroiditis in a Patient with Metastatic Renal Cell Carcinoma: A Case Report.png)
Chemotherapy
ChemotherapyIF0
PREAI
分享收藏A computational avenue towards understanding and design of zwitterionic anti-biofouling materials
PREAI
分享收藏On the Convergence of a Distributed Augmented Lagrangian Method for Nonconvex Optimization关于非凸优化的分布式增广拉格朗日方法的收敛性
PREAI
分享收藏
查看更多内容