Combining approximation and exact penalty in hierarchical programming

被引:3
|
作者
Bigi, Giancarlo [1 ]
Lampariello, Lorenzo [2 ]
Sagratella, Simone [3 ]
机构
[1] Univ Pisa, Dept Comp Sci, Pisa, Italy
[2] Roma Tre Univ, Dept Business Studies, Rome, Italy
[3] Sapienza Univ Rome, Dept Comp Control & Management Engn Antonio Ruber, Rome, Italy
关键词
Hierarchical programming; optimization problems with variational inequality constraints; approximation approaches; penalty techniques; DISTRIBUTED METHODS; BILEVEL PROGRAMS; ALGORITHMS; PARALLEL;
D O I
10.1080/02331934.2021.1939336
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We address the minimization of an objective function over the solution set of a (non-parametric) lower-level variational inequality. This problem is a special instance of semi-infinite programs and encompasses, as particular cases, simple (smooth) bilevel and equilibrium selection problems. We resort to a suitable approximated version of the hierarchical problem. We show that this, on the one hand, does not perturb the original (exact) program 'too much', on the other hand, allows one to rely on some suitable exact penalty approaches whose convergence properties are established.
引用
收藏
页码:2403 / 2419
页数:17
相关论文
共 50 条
  • [21] Distributed optimal resource allocation over networked systems and use of an ε-exact penalty function
    Kia, Solmaz S.
    IFAC PAPERSONLINE, 2016, 49 (04): : 13 - 18
  • [22] A Lifting-Penalty Method for Quadratic Programming with a Quadratic Matrix Inequality Constraint
    Liu, Wei
    Yang, Li
    Yu, Bo
    MATHEMATICS, 2020, 8 (02)
  • [23] A penalty-based method for communication-efficient decentralized bilevel programming
    Nazari, Parvin
    Mousavi, Ahmad
    Tarzanagh, Davoud Ataee
    Michailidis, George
    AUTOMATICA, 2025, 173
  • [24] Combining Two Worlds: Parameterised Approximation for Vertex Cover
    Brankovic, Ljiljana
    Fernau, Henning
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 390 - +
  • [25] Combining probabilistic logic programming with the power of maximum entropy
    Kern-Isberner, G
    Lukasiewicz, T
    ARTIFICIAL INTELLIGENCE, 2004, 157 (1-2) : 139 - 202
  • [26] Faster Exact Computation of rSPR Distance via Better Approximation
    Chen, Zhi-Zhong
    Harada, Youta
    Nakamura, Yuna
    Wang, Lusheng
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2020, 17 (03) : 916 - 929
  • [27] Distributed Nash equilibrium seeking with order-reduced dynamics based on consensus exact penalty
    Liang, Shu
    Liu, Shuyu
    Hong, Yiguang
    Chen, Jie
    CONTROL THEORY AND TECHNOLOGY, 2023, 21 (03) : 363 - 373
  • [28] A Hierarchical Approach to Adaptive Disturbance Attenuation Combining Switching and Tuning
    Battistelli, Giorgio
    Mari, Daniele
    Selvi, Daniela
    Tesi, Alberto
    Tesi, Pietro
    2014 IEEE 53RD ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2014, : 6254 - 6259
  • [29] Hierarchical Programming for Worst-Case Analysis of Power Grids
    Djelassi, Hatim
    Mitsos, Alexander
    Fliscounakis, Stephane
    Panciatici, Patrick
    2018 POWER SYSTEMS COMPUTATION CONFERENCE (PSCC), 2018,
  • [30] Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming
    Zhang, Liwei
    Zhang, Yule
    Xiao, Xiantao
    Wu, Jia
    MATHEMATICS OF OPERATIONS RESEARCH, 2023, 48 (01) : 177 - 193