On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints
DOI:
https://doi.org/10.2298/YJOR180615018NKeywords:
mathematical programs with vanishing constraints, enhanced Fritz John conditions, constraint qualifications, error boundAbstract
In this paper, we considered the mathematical programs with vanishing constraints or MPVC. We proved that an MPVC-tailored penalty function, introduced in [5], is still exact under a very weak and new constraint qualification. Most importantly, this constraint qualification is shown to be strictly stronger than MPVC-Abadie constraint qualification.References
Achtziger, W., Kanzow, C., “Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications”, Mathematical Programming, 114 (2008) 69-99.
Achtziger, W., Hoheisel, T., and Kanzow, C., “A smoothing-regularization approach to mathematical programs with vanishing constraints”, Computational Optimization and Applications, 55 (2013) 733-767.
Burke, J. V., “Calmness and exact penalization”, SIAM Journal on Control and Optimization, 29 (1991) 493-497.
Henrion, R., Outrata, J. V., “Calmness of constraint systems with applications”, Mathematical Programming, 104 (2005) 437-464.
Hoheisel, T., Kanzow, C., Outrata, J.V., “Exact penalty results for mathematical programs with vanishing constraints”, Nonlinear Analysis: Theory, Methods Applications, 72 (5) (2010) 2514-2526.
Hoheisel, T., Kanzow, C., “Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications”, Journal of Mathematical Analysis and Applications, 337 (2008) 292-310.
Hoheisel, T., Kanzow, C., “On the Abadie and Guignard constraint qualification for mathematical programs with vanishing constraints”, Optimization, 58 (2009) 431-448.
Hoheisel, T., Kanzow, C., “First and second order optimality conditions for mathematical programs with vanishing constraints”, Applications of Mathematics, 52 (2007) 495-514.
Hoheisel, T., “Mathematical Programs With Vanishing Constraints”, PhD thesis, 2009.
Hoheisel, T., Kanzow, C., Schwartz, A., “Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints”, Mathematical Programming, Ser. A, 137 (2013) 257-288.
Hu, Q., Wang, J., Chen, Y., Zhu, Z., “On an l1 exact penalty result for mathematical programs with vanishing constraints”, Optimization Letters, 17 (3) (2017) 641-653.
Izmailov, A. F., Solodov, M. V., “Mathematical programs with vanishing constraints: optimality conditions, sensitivity and a relaxation method”, Journal of Optimization Theory and Applications, 114 (3) (2009) 501-532.
Kanzow, C., Schwartz, A., “Mathematical programs with equilibrium constraints: Enhanced Fritz John conditions, New constraint qualifications, and improved exact penalty results”, SIAM Journal of Optimization, 20 (5) (2010) 2730-2753.
Kanzow, C., Schwartz, A., “A new regularization method for mathematical programs with complementarity constraints with strong convergence properties”, SIAM Journal of Optimization, 23 (2) (2013) 770-798.
Khare, A., Nath, T., “Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints”, Journal of Mathematical Analysis and Applications, 472 (1) (2019) 1042-1077.
Kirches, C., Potschka, A., Bock, H.G., and Sager, S., “A parametric active set method for quadratic programs with vanishing constraints”, Technical Report, 2012.
Latombe, J. C., “Robot motion planning”, Kluwer Academic Publishers, Norwell, MA, 1991.
Pang, J.S., “Error bounds in mathematical programming”, Mathematical Programming, 79 (1997) 299-332.
Rockafellar, R.T., Wets, R. J.-B., “Variational Analysis”, in: A series of Comprehensive Studies in Mathematics, 317, Springer, Berlin, 1998.
Ye, J. J., “Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints”, Journal of Mathematical Analysis and Applications, 307 (2005) 350-369.
Downloads
Published
Issue
Section
License
Copyright (c) 2019 YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
