Abstract
Pattern formation in associative neural networks is related to a quadratic optimization problem. Biological considerations imply that the functional is constrained in the L \infty norm and in the L 1 norm. We consider such optimization problems. We derive the Euler–Lagrange equations, and construct basic properties of the maximizers. We study in some detail the case where the kernel of the quadratic functional is finite-dimensional. In this case the optimization problem can be fully characterized by the geometry of a certain convex and compact finite-dimensional set.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Leizarowitz, A., Rubinstein, J. An L \infty/L 1-Constrained Quadratic Optimization Problem with Applications to Neural Networks. Appl Math Optim 49, 55–80 (2004). https://doi.org/10.1007/s00245-003-0780-8
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00245-003-0780-8