On nonsmooth multiobjective semi-infinite programming with switching constraints using tangential subdifferentials
Abstract
We investigate optimality conditions for a nonsmooth multiobjective semi-infinite programming problem subject to switching constraints. In particular, we employ a surrogate problem and a suitable constraint qualification to state necessary M-stationary conditions in terms of tangential subdifferentials. An example is given at the end to illustrate our main result.References
A. Rund, and K. Kunisch, Nonconvex penalization of switching control of partial differential equations, Systems & Control Letters, vol. 106, pp. 1–8, 2017.
M. Gugat, Optimal switching boundary control of a string to rest in finite time, ZAMM-Journal of Applied Mathematics and Mechanics, vol. 88, no. 4, pp. 283–305, 2010.
S. Sager, Reformulations and algorithms for the optimization of switching decisions in nonlinear optimal control, Journal of Process Control, vol. 19, no. 8, pp 1238–1247, 2009.
P. Mehlitz, Stationarity conditions and constraint qualifications for mathematical programs with switching constraints,
Mathematical Programming, vol. 181, no. 1, pp 149–186, 2020.
S. Dempe, and H. Schreier, Operations research: deterministische Modelle und Methoden, Springer-Verlag, 2007.
R. A. Sarker, and C. S. Newton, Optimization Modelling, CRC Press, Boca Raton, 2008.
Z. Q. Luo, J. S. Pang, and D. Ralph, Mathematical Programs with Equilibrium Constraints, Cambridge University Press, Cambridge, 1996.
J. V. Outrata, M. Kocvara, and J. Zowe, Nonsmooth approach to optimization problems with equilibrium constraints, Kluwer Academic, Dordrecht, 1998.
G. H. Lin, and M. Fukushima, A modified relaxation scheme for mathematical programs with complementarity constraints, Annals of Operations Research, vol. 133, no. 1, pp. 63–84, 2005.
C. Kanzow, P. Mehlitz, and D. Steck, Relaxation schemes for mathematical programmes with switching constraints, Optimization Methods and Software, vol. 36, no. 6, pp. 1223–1258, 2021.
G. Li, and L. Guo, Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications, Optimization, pp. 1–22, 2022.
P. Mehlitz, On the linear independence constraint qualification in disjunctive programming, Optimization, pp. 1–37, 2019.
M. Jennane, E. M. Kalmoun, and L. El Fadil, Optimality conditions for nonsmooth multiobjective bilevel optimization using tangential subdifferentials, RAIRO–Operations Research, vol. 55, no. 5, pp. 3041–3048, 2021.
B. N. Pshenichnyi, Necessary Conditions for an Extremum, New York, NY: Marcel Dekker Inc, 1971.
C. Lemarechal, An introduction to the theory of nonsmooth optimization, Optimization. vol. 17, no. 6, 827–858, 1986.
F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1983.
P. Michel and J. P. Penot, A generalized derivative for calm and stable functions, Differential and Integral Equations, vol. 5, no. 2, 433–454, 1992.
R. T. Rockafellar, Convex Analysis, in: Princeton Mathematical Series, vol. 28. Princeton, NJ: Princeton University Press, 1970.
M. A. Goberna, and M. A Lopez, Linear Semi-Infinite Optimization, Chichester: Wiley, 1998.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).