Scholarlink

Nonsmooth optimization (NSO) refers to the general problem of minimizing (or maximizing) functions that are typically not differentiable. Due to the complexity of the real world, functions involved in practical applications are often nonsmooth. For example, a wide range of problems in the fields of machine learning and multi-agent system can fall into NSO form Tibshirani et al. (2005), Lin et al. (2017). Therefore, NSO problems for multi-agent systems have attracted more and more attention due to the wide applications.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Distributed Proximal-Gradient Algorithms for Nonsmooth Convex Optimization of Second-Order Multi-agent Systems

  • 章节

  • 发表日期：

    2025年

查看全文
  • Qing Wang,
  • Bin Xin,
  • Jie Chen

摘要

Nonsmooth optimization (NSO) refers to the general problem of minimizing (or maximizing) functions that are typically not differentiable. Due to the complexity of the real world, functions involved in practical applications are often nonsmooth. For example, a wide range of problems in the fields of machine learning and multi-agent system can fall into NSO form Tibshirani et al. (2005), Lin et al. (2017). Therefore, NSO problems for multi-agent systems have attracted more and more attention due to the wide applications.