MPVC问题的Scholtes松弛方法收敛性研究
Convergence Research of the Scholtes Relaxation Method for MPVC
摘要: 带消失约束的数学规划问题(MPVC)在工程设计、最优控制和路径规划等领域应用广泛。然而,因其可行集非凸,导致标准非线性规划问题中的多数约束规范失效,给MPVC问题的算法设计与收敛性分析带来困难。Scholtes松弛方法是求解该类问题最常用的松弛方法之一,已有收敛性结论在MPVC-MFCQ条件下保证收敛到T-稳定点,数值表现良好。本文基于Scholtes松弛方法,在MPVC-MFCQ假设下证明迭代序列收敛到更强的M-稳定点,并在更弱的MPVC-CCP约束规范下得到了相同的收敛结论。
Abstract: Mathematical programs with vanishing constraints (MPVC) are widely applied in fields such as engineering design, optimal control, and path planning. However, due to the nonconvexity of their feasible sets, most constraint qualifications in standard nonlinear programming fail to hold, which poses difficulties for the algorithm design and convergence analysis of MPVC problems. The Scholtes relaxation method is one of the most commonly used regularization approaches for solving such problems. Existing convergence results guarantee convergence to T-stationary points under the MPVC-MFCQ condition, and the method performs well numerically. In this paper, based on the Scholtes relaxation method, we prove that the iterative sequence converges to the stronger M-stationary points under the MPVC-MFCQ assumption, and we obtain the same convergence result under the weaker MPVC-CCP constraint qualification.
文章引用:刘婷. MPVC问题的Scholtes松弛方法收敛性研究[J]. 应用数学进展, 2026, 15(11): 67-78. https://doi.org/10.12677/aam.2026.1511433

参考文献

[1] Achtziger, W. and Kanzow, C. (2007) Mathematical Programs with Vanishing Constraints: Optimality Conditions and Constraint Qualifications. Mathematical Programming, 114, 69-99.
https://doi.org/10.1007/s10107-006-0083-3
[2] Hoheisel, T. and Kanzow, C. (2008) Stationary Conditions for Mathematical Programs with Vanishing Constraints Using Weak Constraint Qualifications. Journal of Mathematical Analysis and Applications, 337, 292-310.
https://doi.org/10.1016/j.jmaa.2007.03.087
[3] 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
[4] Achtziger, W., Kanzow, C. and Hoheisel, T. (2012) On a Relaxation Method for Mathematical Programs with Vanishing Constraints. GAMM-Mitteilungen, 35, 110-130.
https://doi.org/10.1002/gamm.201210009
[5] 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
[6] Hoheisel, T., Kanzow, C. and Schwartz, A. (2012) Mathematical Programs with Vanishing Constraints: A New Regularization Approach with Strong Convergence Properties. Optimization, 61, 619-636.
https://doi.org/10.1080/02331934.2011.608164
[7] Dussault, J.-., Haddou, M. and Migot, T. (2019) Mathematical Programs with Vanishing Constraints: Constraint Qualifications, Their Applications, and a New Regularization Method. Optimization, 68, 509-538.
https://doi.org/10.1080/02331934.2018.1542531
[8] 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
[9] Ramos, A. (2021) Mathematical Programs with Equilibrium Constraints: A Sequential Optimality Condition, New Constraint Qualifications and Algorithmic Consequences. Optimization Methods and Software, 36, 45-81.
https://doi.org/10.1080/10556788.2019.1702661
[10] Hoheisel, T., Pablos, B., Pooladian, A., Schwartz, A. and Steverango, L. (2022) A Study of One-Parameter Regularization Methods for Mathematical Programs with Vanishing Constraints. Optimization Methods and Software, 37, 503-545.
https://doi.org/10.1080/10556788.2020.1797025