Abstract

We consider convex continuous-time optimization problems with inequality type of constraints. By using subdifferential approximation of the considered problem and new alternative theorem for convex inequalities in functional spaces, necessary optimality conditions are obtained. Moreover, the main result is refined when affine functions are separately considered from other convex non-affine functions.

Author information

Contact details are reproduced from the original publication and may be historical.

Boban Marinković

Dept. of Mathematics, University of Belgrade, Serbia

Keywords

  • Continuous-time programming
  • convex programming
  • optimality conditions
  • theorems of the alternative

Mathematics Subject Classification

90C30, 90C46

References

  1. J. Abraham, R. N. Buie: Kuhn-Tucker conditions and duality in continuous programming, Utilitas Math. 16 (1979) 15–37.Google Scholar
  2. V. M. Alekseev, V. M. Tikhomirov, S. V. Fomin: Optimal Control, Plenum Publishing Corporation, New York (1987).https://doi.org/10.1007/978-1-4615-7551-1Google Scholar
  3. A. V. Arutyunov, S. E. Zhukovskiy, B. Marinković: Theorems of the Alternative for systems of convex inequalities, Set-Valued Var. Anal. 27 (2019) 51–70.https://doi.org/10.1007/s11228-017-0406-yGoogle Scholar
  4. R. Bellman: Bottleneck problems and dynamic programming, Proc. Nat. Acad. Sci. U.S.A. 39 (1953) 947–951.https://doi.org/10.1073/pnas.39.9.947Google Scholar
  5. A. J. V. Brandão, M. A. Rojas-Medar, G. N. Silva: Nonsmooth continuous-time optimization problems: necessary conditions, Comput. Math. Appl. 41 (2001) 1477–1486.https://doi.org/10.1016/S0898-1221(01)00112-2Google Scholar
  6. V. A. de Oliveira, M. A. Rojas-Medar: Continuous-time optimization problems involving invex functions, J. Math. Analysis Appl. 327 (2007) 1320–1334.https://doi.org/10.1016/j.jmaa.2006.05.005Google Scholar
  7. M. R. C. do Monte, V. A. de Oliveira: Necessary conditions for continuous-time optimization under the Mangasarian–Fromovitz constraint qualification, Optimization 69/4 (2020) 777–798.https://doi.org/10.1080/02331934.2019.1653294Google Scholar
  8. M. A. Hanson, B. Mond: A class of continuous convex programming problems, J. Math. Analysis Appl. 22 (1968) 427–437.https://doi.org/10.1016/0022-247X(68)90184-4Google Scholar
  9. A. Jović, B. Marinković: New optimality criteria for convex continuous-time problems of vector optimization, Optimization 71/15 (2022) 4555–4570.https://doi.org/10.1080/02331934.2021.1950152Google Scholar
  10. O. L. Mangasarian: Nonlinear Programming, McGraw-Hill, New York (1969).Google Scholar
  11. J. V. Outrata, W. Römisch: On optimality conditions for some nonsmooth optimization problems over Lp spaces, J. Optim. Theory Appl. 126 (2005) 411–438.https://doi.org/10.1007/s10957-005-4724-0Google Scholar
  12. T. W. Reiland: Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative, J. Math. Analysis Appl. 77 (1980) 297–325.https://doi.org/10.1016/0022-247X(80)90278-4Google Scholar
  13. T. W. Reiland, M. A. Hanson: Generalized Kuhn-Tucker conditions and duality for continuous-time nonlinear programming problems, J. Math. Analysis Appl. 74 (1980) 578–598.https://doi.org/10.1016/0022-247X(80)90149-3Google Scholar
  14. C. H. Scott, T. R. Jefferson: Duality in infinite-dimensional mathematical programming: Convex integral functionals, J. Math. Analysis Appl. 61 (1977) 251–261.https://doi.org/10.1016/0022-247X(77)90159-7Google Scholar
  15. G. J. Zalmai: Optimality conditions and Lagrangian duality in continuous-time nonlinear programming, J. Math. Analysis Appl. 109 (1985) 426–452.https://doi.org/10.1016/0022-247X(85)90160-XGoogle Scholar
  16. G. J. Zalmai: A continuous time generalization of Gordan’s Transposition Theorem, J. Math. Analysis Appl. 110 (1985) 130–140.https://doi.org/10.1016/0022-247X(85)90339-7Google Scholar
  17. G. J. Zalmai: The Fritz-John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming, J. Math. Analysis Appl. 110 (1985) 503–518.https://doi.org/10.1016/0022-247X(85)90312-9Google Scholar
  18. G. J. Zalmai: Sufficient optimality conditions in continuous-time nonlinear programming, J. Math. Analysis Appl. 111 (1985) 130–147.https://doi.org/10.1016/0022-247X(85)90206-9Google Scholar

Suggested citation

J. Vicanović, B. Marinković. “Necessary Optimality Conditions for Convex Continuous-Time Optimization Problems.” Journal of Convex Analysis 30 (2023), No. 1, 5–16. https://doi.org/10.68381/jca30002

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2023. Rights now held by Banach Press LLC.