Identification of sparse nonlinear controlled variables for near-optimal operation of chemical processes

被引:0
|
作者
Ma, Xie [1 ]
Guan, Hongwei [2 ]
Ye, Lingjian [3 ]
机构
[1] Ningbo Univ Finance & Econ, Ningbo, Peoples R China
[2] Zhejiang Business Technol Inst, Ningbo, Peoples R China
[3] Huzhou Univ, Sch Engn, Huzhou Key Lab Intelligent Sensing & Optimal Contr, Huzhou 313000, Peoples R China
来源
CANADIAN JOURNAL OF CHEMICAL ENGINEERING | 2024年
基金
中国国家自然科学基金;
关键词
chemical process; feedback control; neural networks; optimization; regularization; SELF-OPTIMIZING CONTROL; BATCH;
D O I
10.1002/cjce.25514
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
For optimal operation of chemical processes, the selection of controlled variables plays an important role. A previous proposal is to approximate the necessary conditions of optimality (NCO) as the controlled variables, such that process optimality is automatically maintained by tracking constant zero setpoints. In this paper, we extend the NCO approximation method by identifying sparse nonlinear controlled variables, motivated by the fact that simplicity is always favoured for practical implementations. To this end, the l1$$ {l}_1 $$-regularization is employed to approximate the NCO, such that the controlled variables are maintained simple, even they are specified as nonlinear functions. The sparse controlled variables are solved using the proximal gradient method, implemented within a tailored Adam algorithm. Two case studies are provided to illustrate the proposed approach.
引用
收藏
页数:16
相关论文
共 50 条
  • [21] Near-optimal operation of dual-fuel launch vehicles
    Ardema, MD
    Chou, HC
    Bowles, JV
    JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1996, 19 (05) : 1180 - 1182
  • [22] Near-Optimal Recursive Identification for Markov Switched Systems
    Andrien, Alex
    Antunes, Duarte J.
    2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, : 132 - 138
  • [23] Near-optimal probabilistic search using spatial Fourier sparse set
    Kuo-Shih Tseng
    Bérénice Mettler
    Autonomous Robots, 2018, 42 : 329 - 351
  • [24] Near-optimal probabilistic search using spatial Fourier sparse set
    Tseng, Kuo-Shih
    Mettler, Berenice
    AUTONOMOUS ROBOTS, 2018, 42 (02) : 329 - 351
  • [25] A Near-Optimal Distributed Fully Dynamic Algorithm for Maintaining Sparse Spanners
    Elkin, Michael
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 185 - 194
  • [26] A Near-Optimal Condition for Exact Sparse Recovery with Orthogonal Least Squares
    Kim, Junhan
    Shim, Byonghyo
    2019 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC), 2019,
  • [27] Practical Near-optimal Sparse Recovery in the L1 Norm
    Berinde, R.
    Indyk, P.
    Ruzic, M.
    2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 198 - +
  • [28] A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
    Alemazkoor, Negin
    Meidani, Hadi
    JOURNAL OF COMPUTATIONAL PHYSICS, 2018, 371 : 137 - 151
  • [29] Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
    Eppstein, David
    Loeffler, Maarten
    Strash, Darren
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 403 - 414
  • [30] Controlled Variables from Optimal Operation Data
    Jaschke, Johannes
    Skogestad, Sigurd
    21ST EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2011, 29 : 753 - 757