2023/07/04 by Nazih Abderrazzak Gadhi, Mohamed Ohda
Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Bilevel optimization #Calmness #Mathematical optimization #Mathematics #Optimization and Mathematical Programming #Optimization and Variational Analysis #Optimization problem #Property (philosophy) #Sequence (biology)
paper · doi:10.1080/02331934.2023.2231501
crossref issued 2023/07/04 · crossref published 2023/07/04 · crossref published-online 2023/07/04 · openalex publication_date 2023/07/04 · crossref created 2023/07/04 · crossref deposited 2024/08/22 · crossref published-print 2024/09/01 · openalex created_date 2025/10/10 · crossref indexed 2026/08/04 · openalex updated_date 2026/08/05
The problem considered in this paper is a sequence of two optimization problems in which the feasible region of the upper-level optimization problem is determined implicitly by the solution set of the lower-level optimization problem. Using the optimal value reformulation, together with the partial calmness property, we give necessary optimality conditions in terms of tangential subdifferentials. An example that illustrates our finding is also given.