Approximate stationarity conditions provide necessary optimality conditions without requiring additional assumptions by demanding that a perturbed stationarity system possesses solutions as the involved perturbations tend to zero. Together with associated approximate constraint qualifications, which are typically rather mild, they raised much interest in the optimization community during the last decade. In parallel, directional stationarity conditions became quite popular as they sharpen standard stationarity conditions by incorporating data associated with underlying critical directions. The purpose of this paper is twofold. First, we melt the aforementioned concepts of approximate and directional stationarity to formulate and study so-called approximate directional stationarity. For the underlying model problem, an optimization problem with nonsmooth geometric constraints is chosen, which covers diverse practically relevant applications. The role of approximate directional stationarity as a necessary optimality condition is investigated in much detail, complementing results from the literature. Second, we formulate a qualification condition which, based on an approximately directionally stationary point, can be exploited to infer its directional stationarity. The latter condition depends on one particular sequence verifying approximate directional stationarity and merely requires to check a simple condition of Mangasarian--Fromovitz type stated in terms of the directional tools of limiting variational analysis. This contrasts standard approximate constraint qualifications that typically demand a certain stable behavior of all sequences validating approximate stationarity. Throughout, various approaches to verify directional stationarity of local minimizers are established, and illustrative examples are presented to make the theoretical results more accessible.
Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
On Constraint Qualifications for MPECs with Applications to Bilevel Hyperparameter Optimization for Machine Learning
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(北京信息计算安全数学理论与计算重点实验室);School of Mathematical Sciences, University of Southampton(南安普顿大学数学科学学院)
Sufficient Conditions for Metric Subregularity of Constraint Systems with Applications to Disjunctive and Ortho-Disjunctive Programs
本文研究一般最优化问题的度量次正则约束规格(MSCQ),重点是非凸设置。我们详细阐述了方向伪正态性和准正态性的概念,最近由Bai等人(SIAM J. Opt.,2019年),它结合了标准的方法,通过伪和准常态与现代工具的方向变分分析。我们专注于应用程序的析取程序,其中(方向)伪正规性的特点是通过一个极值条件。这反过来又产生了有效的工具来验证伪正规性和MSCQ,其中包括但不限于Robinson关于多面体多函数的结果和Gfrerer关于度量次正则性的二阶充分条件。最后,我们完善我们的研究,通过定义一类新的ortho-disjunctive程序,其中包括突出的最优化问题,如数学规划的互补性,消失或切换约束。
Optimality conditions in terms of Bouligand generalized differentials for a nonsmooth semilinear elliptic optimal control problem with distributed and boundary control pointwise constraints
Radial Epiderivative Based Fritz John and KKT Conditions in Nonsmooth Nonconvex Optimization
Chongqing Normal University(重庆师范大学);Eskisehir Technical University(埃斯基谢希尔理工大学);China Medical University(中国医药大学);Academy of Romanian Scientists(罗马尼亚科学家学院)