Applications in the areas of data fitting, forecasting, and estimation naturally lead to a rich class of constrained infinite-dimensional optimization problems over extended real-valued semicontinuous functions. We discuss a framework for dealing with such applications, even in the presence of nearly arbitrary constraints on the functions. We formulate computationally tractable approximating problems relying on piecewise polynomial semicontinuous approximations of the actual functions. The approximations enable the study of evolving problems caused by incrementally arriving data and other information. In contrast to an earlier more general treatment, we focus on optimization over functions defined on a compact interval of the real line, which still addresses a large number of applications. The paper provides an introduction to the subject through simplified derivations and illustrative examples.
Mathematical Programming – Springer Journals
Published: Mar 8, 2017
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.
All for just $49/month
It’s easy to organize your research with our built-in tools.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud