An adaptive gradient law with projection for non-smooth convex boundaries

被引:3
|
作者
Kuhnen, K.
Krejci, P.
机构
[1] Univ Saarland, LPA, D-66123 Saarbrucken, Germany
[2] Acad Sci Czech Republ, Inst Math, CZ-11567 Prague, Czech Republic
[3] WIAS, D-10117 Berlin, Germany
关键词
adaptive gradient law; non-smooth convex constraints; adaptive hysteresis compensation; projected dynamical system;
D O I
10.3166/ejc.12.606-619
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The parameter projection method, which has been designed for solving on-line parameter identification problems under smooth convex restrictions is extended here to arbitrary convex parameter domains. Such problems arise naturally in cases where an admissible solution set results from the intersection of several (possibly smooth) convex constraints. The corresponding adaptive gradient law has the form of a special evolution projected dynamical system with a discontinuous right-hand side. The paper develops an alternative formulation of this projected dynamical system based on the multidimensional stop operator. The advantage of this approach is that the new right-hand side is continuous and the problem is thus accessible to conventional analysis methods, which easily give results on exixtence, uniqueness, and convergence properties of the corresponding solution trajectories. The method is tested on the parameter identification problem for complex hysteresis nonlinearities.
引用
收藏
页码:606 / 619
页数:14
相关论文
共 50 条
  • [1] Discussion on: "An adaptive gradient law with projection for non-smooth convex boundaries"
    Back, Juhoon
    Shim, Hyungbo
    EUROPEAN JOURNAL OF CONTROL, 2006, 12 (06) : 620 - 621
  • [2] A memory gradient method for non-smooth convex optimization
    Ou, Yigui
    Liu, Yuanwen
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2015, 92 (08) : 1625 - 1642
  • [3] An adaptive gradient sampling algorithm for non-smooth optimization
    Curtis, Frank E.
    Que, Xiaocun
    OPTIMIZATION METHODS & SOFTWARE, 2013, 28 (06): : 1302 - 1324
  • [4] Inexact Proximal Gradient Methods for Non-Convex and Non-Smooth Optimization
    Gu, Bin
    Wang, De
    Huo, Zhouyuan
    Huang, Heng
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3093 - 3100
  • [5] Simple Stochastic Gradient Methods for Non-Smooth Non-Convex Regularized Optimization
    Metel, Michael R.
    Takeda, Akiko
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [6] On non-smooth convex distance functions
    Le, NM
    INFORMATION PROCESSING LETTERS, 1997, 63 (06) : 323 - 329
  • [7] A proximal gradient method for control problems with non-smooth and non-convex control cost
    Natemeyer, Carolin
    Wachsmuth, Daniel
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 80 (02) : 639 - 677
  • [8] Classical solutions for the pressure-gradient equations in non-smooth and non-convex domains
    Kim, EH
    Song, K
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2004, 293 (02) : 541 - 550
  • [9] Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization
    Lin, Zhenwei
    Xia, Jingfan
    Deng, Qi
    Luo, Luo
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 16, 2024, : 17477 - 17486
  • [10] Convergence of Constant Step Stochastic Gradient Descent for Non-Smooth Non-Convex Functions
    Pascal Bianchi
    Walid Hachem
    Sholom Schechtman
    Set-Valued and Variational Analysis, 2022, 30 : 1117 - 1147