This article considers the following function approximation problem: Given a non-negative function and a set of equality constraints, find the closest to it non-negative function which satisfies the constraints. As a measure of distance we propose the L2-norm of the logarithm of the ratio of the two functions. As shown, this metric guarantees that (i) the sought function is non-negative and (ii) to the extent to which the constraints allow, the magnitude of the difference between the sought and the given function is proportional to the magnitude of the given function. To solve the problem we convert it to a finite dimensional constrained optimization problem and apply the method of Lagrange multipliers. The resulting nonlinear system, together with the system for the constraints, are solved self-consistently by applying an appropriate iterative procedure.
CITATION STYLE
Gospodinov, I. D., Filipov, S. M., & Atanassov, A. V. (2019). Solving function approximation problems using the L2-Norm of the log ratio as a metric. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11189 LNCS, pp. 115–124). Springer Verlag. https://doi.org/10.1007/978-3-030-10692-8_13
Mendeley helps you to discover research relevant for your work.