We propose techniques for approximating bilevel optimization problems with non-smooth lower level problems that can have a non-unique solution. To this end, we substitute the expression of a minimizer of the lower level minimization problem with an iterative algorithm that is guaranteed to converge to a minimizer of the problem. Using suitable non-linear proximal distance functions, the update mappings of such an iterative algorithm can be differentiable, notwithstanding the fact that the minimization problem is non-smooth.
Two-level value function approach to nonsmooth optimistic and pessimistic bilevel programs
作者在Optimization 63(2014),505-533中的论文,参见参考文献[5],是第一篇为悲观双层优化提供详细最优性条件的论文。那里的结果基于SIAM J. Optim中引入和分析的两级最优值函数的概念。22(2012),1309-1343;参见参考文献[4],关于乐观双层规划的情况。在这两篇论文的基本假设之一是,在问题中涉及的功能至少是连续可微的。许多现实世界中的应用程序的优化涉及的功能是不可微的,在某些点的域的动机,目前的主要目标是扩展的两级值函数的方法,以获得新的必要最优性条件的乐观和悲观的版本在双层规划与非光滑数据。
A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));Shenzhen University(深圳大学);Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院);University of Chinese Academy of Sciences(中国科学院大学);National University of Singapore(新加坡国立大学)
On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
Institute of Information Theory and Automation, Czech Academy of Sciences(捷克科学院信息论与自动化研究所);Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences(奥地利科学院约翰·拉登计算与应用数学研究所);School of Mathematics, University of Birmingham(伯明翰大学数学学院)
Bilevel Programming Approach for Image Restoration Problems with Automatically Hyperparameter Selection
School of Mathematics and Statistics, Henan University(河南大学数学与统计学院);Center for Applied Mathematics of Henan Province, Henan University(河南省应用数学中心,河南大学);School of Nursing and Health, Henan University(河南大学护理与健康学院);School of Software, Henan University(河南大学软件学院)
Dynamic sampling schemes for optimal noise learning under multiple nonsmooth constraints
我们考虑由De Los Reyes,Schönlieb(2013)提出的双层优化方法,用于学习具有多个噪声分布的全变差(TV)去噪模型中的最佳参数。在应用中,数据库(字典)的使用允许参数的准确估计,但由于数据库的大小和PDE约束的非光滑性质,反映在高计算成本。为了克服这一计算障碍,我们提出了一个优化算法,通过采样动态从一组约束条件,并使用拟牛顿法,准确地解决了这个问题,并在一个有效的方式。
A Single-Loop Gradient Algorithm for Pessimistic Bilevel Optimization via Smooth Approximation
Southern University of Science and Technology(南方科技大学);National Center for Applied Mathematics Shenzhen, Southern University of Science and Technology(深圳应用数学国家中心);Detection Institute for Advanced Technology Longhua-Shenzhen (DIATLHSZ)(龙华-深圳先进技术检测研究院)
Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
Southern University of Science and Technology(南方科技大学);National Center for Applied Mathematics Shenzhen(深圳应用数学国家研究中心);City University of Hong Kong(香港城市大学)
Exact-Penalty Prox-Linear Methods for Bilevel Optimization with $\ell_1$ Lower-Level Gradient Penalty
School of Mathematics and Statistics, Beijing Institute of Technology(北京理工大学数学与统计学院);Beijing Key Laboratory on MCAACI/Key Laboratory of Mathematical Theory and Computation in Information Security, Beijing Institute of Technology(北京理工大学计算机辅助设计与图形学北京市重点实验室/信息安全数学理论计算北京市重点实验室)
A Surrogate Value Function Formulation for Bilevel Optimization
Institute of Mathematics, Hebei University of Technology(河北工业大学数学研究所);Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院)
Riemannian Smoothing Gradient Type Algorithms]{Riemannian Smoothing Gradient Type Algorithms for Nonsmooth Optimization Problem on Compact Riemannian Submanifold Embedded in Euclidean Space
FAB: A First-Order AB-based Gradient Algorithm for Distributed Bilevel Optimization over Time-Varying Directed Graphs
Southern University of Science and Technology(南方科技大学);Peng Cheng Laboratory(鹏城实验室);School of Computer Science and Engineering, Sun Yat-Sen University(中山大学计算机科学与工程学院);School of Artificial Intelligence, Southern University of Science and Technology(南方科技大学人工智能学院);National Center for Applied Mathematics Shenzhen(深圳应用数学国家研究中心);Detection Institute for Advanced Technology Longhua-Shenzhen(深圳龙华先进技术检测研究院)
Asymptotic Analysis of Gradient Mapping-type Stationarity Measure for the Sum of Nonconvex Nonsmooth Functions and Applications to Proximal Gradient-type Algorithms