基于Scholtes松弛方法的收敛性研究
Convergence Research Based on Scholtes’ Relaxation Method
摘要: 带有切换约束的数学规划问题(MPSC)在切换控制、MPEOC、具有半连续变量的投资组合优化问题等领域有着广泛的应用。MPSC带有可行域非凸非连通的特殊结构,因而在可行点处不满足大多数约束规范,往往难于求解。松弛方法被普遍视为解决MPSC问题的有效方法。本文基于Scholtes松弛方法以及非精确稳定点的概念,证明了在较弱的 ε -KKT点条件下能得到与KKT点条件相同的结果,即收敛到了MPSC的W-稳定点,如果增强假设条件,松弛问题的 ε -KKT点列可收敛到MPSC的S-稳定点。
Abstract: Mathematical programming with switching constraints (MPSC) has broad applications in fields such as switching control, MPEOC, and portfolio optimization problems with semi-continuous variables. MPSC features a special structure where the feasible region is non-convex and non-connected, making it difficult to solve, as most constraint qualifications fail at feasible points. Relaxation methods are widely regarded as effective approaches for addressing MPSC problems. Based on Scholtes’ relaxation method and the concept of inexact stationary points, this paper demonstrates that under weaker ε -KKT point conditions, results equivalent to those under KKT point conditions can be achieved, i.e., convergence to W-stationary points of MPSC. With enhanced assumptions, sequences of ε -KKT points from the relaxed problem can converge to S- stationary points of MPSC.
文章引用:班路园. 基于Scholtes松弛方法的收敛性研究[J]. 应用数学进展, 2026, 15(8): 103-110. https://doi.org/10.12677/aam.2026.158337

参考文献

[1] Clason, C., Rund, A. and Kunisch, K. (2017) Nonconvex Penalization of Switching Control of Partial Differential Equations. Systems & Control Letters, 106, 1-8.
https://doi.org/10.1016/j.sysconle.2017.05.006
[2] Hante, F.M. and Sager, S. (2013) Relaxation Methods for Mixed-Integer Optimal Control of Partial Differential Equations. Computational Optimization and Applications, 55, 197-225.
https://doi.org/10.1007/s10589-012-9518-3
[3] Mehlitz, P. (2020) Stationarity Conditions and Constraint Qualifications for Mathematical Programs with Switching Constraints. Mathematical Programming, 181, 149-186.
https://doi.org/10.1007/s10107-019-01380-5
[4] Frangioni, A. and Gentile, C. (2007) SDP Diagonalizations and Perspective Cuts for a Class of Nonseparable MIQP. Operations Research Letters, 35, 181-185.
https://doi.org/10.1016/j.orl.2006.03.008
[5] Hoheisel, T., Kanzow, C. and Schwartz, A. (2011) Theoretical and Numerical Comparison of Relaxation Methods for Mathematical Programs with Complementarity Constraints. Mathematical Programming, 137, 257-288.
https://doi.org/10.1007/s10107-011-0488-5
[6] Hoheisel, T., Kanzow, C. and Schwartz, A. (2012) Convergence of a Local Regularization Approach for Mathematical Programmes with Complementarity or Vanishing Constraints. Optimization Methods and Software, 27, 483-512.
https://doi.org/10.1080/10556788.2010.535170
[7] Kanzow, C., Mehlitz, P. and Steck, D. (2019) Relaxation Schemes for Mathematical Programmes with Switching Constraints. Optimization Methods and Software, 36, 1223-1258.
https://doi.org/10.1080/10556788.2019.1663425
[8] Scholtes, S. (2001) Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints. SIAM Journal on Optimization, 11, 918-936.
https://doi.org/10.1137/s1052623499361233
[9] Kanzow, C. and Schwartz, A. (2015) The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited. Mathematics of Operations Research, 40, 253-275.
https://doi.org/10.1287/moor.2014.0667
[10] Li, G. and Guo, L. (2022) Mordukhovich Stationarity for Mathematical Programs with Switching Constraints under Weak Constraint Qualifications. Optimization, 72, 1817-1838.
https://doi.org/10.1080/02331934.2022.2038151
[11] Kanzow, C. and Schwartz, A. (2010) A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties. Institute of Mathematics, 8-14.