Kay Barshad, The generic approach to modern optimization, Vol. 2022 (2022), Article ID 9, pp. 1-20

Full Text: PDF
DOI: 10.23952/cot.2022.9

Received June 28 2022; Accepted July 30, 2022; Published August 22, 2022

 

Abstract. In this paper, we survey some recent applications of the generic approach to selected optimization problems, such as minimization of convex functionals and stochastic feasibility problems. We also overview a few recent developments related to the residuality properties of certain classes of convex functions, the abundance of which is known to be crucial in many optimization algorithms for which the elements of a certain class can be used as good approximates of given convex functions.

 

How to Cite this Article:
K. Barshad, The generic approach to modern optimization, Commun. Optim. Theory 2022 (2022) 9.