返回
Penalty Method for Constrained Distributed Quaternion-Variable Optimization
DOI:10.1109/TCYB.2020.3031687.png)
摘要
En 中文
This article studies the constrained optimization problems in the quaternion regime via a distributed fashion. We begin with presenting some differences for the generalized gradient between the real and quaternion domains. Then, an algorithm for the considered optimization problem is given, by which the desired optimization problem is transformed into an unconstrained setup. Using the tools from the Lyapunov-based technique and nonsmooth analysis, the convergence property associated with the devised algorithm is further guaranteed. In addition, the designed algorithm has the potential for solving distributed neurodynamic optimization problems as a recurrent neural network. Finally, a numerical example involving machine learning is given to illustrate the efficiency of the obtained results.
Keyword:
Quaternions
Optimization
Convex functions
Machine learning
Neurodynamics
Image color analysis
Cost function
Distributed optimization
machine learning
neural network
nonsmooth analysis
penalty method
quaternion
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Distributed Continuous-Time Algorithms for Resource Allocation Problems Over Weight-Balanced Digraphs权重平衡有向图上资源分配问题的分布式连续时间算法
Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
AUTOMATICA
IF5.9
Distributed Nonsmooth Optimization With Coupled Inequality Constraints via Modified Lagrangian Function基于修正拉格朗日函数的耦合不等式约束分布式非光滑优化

