@inproceedings{5af76f554a3b457489c68119f1f3f981,
title = "On the Non-Computability of Convex Optimization Problems",
abstract = "This paper explores the computability of the optimal point in convex problems with inequality constraints. It is shown that feasible sets, defined by computable convex functions, can yield non-computable optimal points for strictly convex and computable objective functions. Additionally, the optimal point of the Lagrangian dual problem associated with such convex constraints is also proven to be non-computable. Despite converging sequences of computable numbers towards the Lagrangian's optimal point, algorithmic control of the approximation error is shown to be impossible.",
author = "Holger Boche and Andrea Grigorescu and Schaefer, \{Rafael F.\} and Poor, \{H. Vincent\}",
note = "Publisher Copyright: {\textcopyright} 2024 IEEE.; 2024 IEEE International Symposium on Information Theory, ISIT 2024 ; Conference date: 07-07-2024 Through 12-07-2024",
year = "2024",
doi = "10.1109/ISIT57864.2024.10619549",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "3083--3088",
booktitle = "2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings",
address = "United States",
}