Global minimization of a quadratic functional: neural network approach
L. B. Litinskii, B. M. Magomedov
Abstract
The problem of finding out the global minimum of a multiextremal functional is discussed. One frequently faces with such a functional in various applications. We propose a procedure, which depends on the dimensionality of the problem polynomially. In our approach we use the eigenvalues and eigenvectors of the connection matrix.
Create a lesson
Related papers
Position Paper: Neurotransmitters as a Missing Dimension in Artificial Neural Networks
Yupei Li, Manuel Milling, Berrak Sisman et al.
A Metaheuristic Optimization Framework for Discrete Optimization under Strict Time Limits
Umut Çalıkyılmaz, Nitin Nayak, Sven Groppe
Benchmarking Tabular Foundation Models as Surrogates in Expensive Evolutionary Optimization
Lu Han, Jin Wang, Yuchen Li et al.
A Spatiotemporal Extension of the Neuromorphic DBSCAN Implementation
Charles P. Rizzo, James S. Plank
Machine Zygote: Causal Biparental Heredity Before Learning in a Germline--Soma Artificial Agent
Lyes Saad Saoud
Bio-Inspired Palette Evolution in Indirectly Encoded Substrates: Timescale Compatibility Shapes Activation Function Discovery
Romain Claret, Michael O'Neill, Paul Cotofrei et al.