Hopfield neural networks in large-scale linear optimization problems
From MaRDI portal
Publication:428100
DOI10.1016/j.amc.2011.12.059zbMath1245.90055OpenAlexW2062476100MaRDI QIDQ428100
Christiano Lyra, Marta I. Velazco Fontova, Aurelio Ribeiro Leite Oliveira
Publication date: 19 June 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.12.059
Large-scale problems in mathematical programming (90C06) Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)
Related Items (3)
Novel passivity and dissipativity criteria for discrete-time fractional generalized delayed Cohen-Grossberg neural networks ⋮ Global exponential stability of discrete-time higher-order Cohen-Grossberg neural networks with time-varying delays, connection weights and impulses ⋮ Sensitivity of optimal control for diffusion Hopfield neural network in the presence of perturbation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Warm start by Hopfield neural networks for interior point methods
- A new nonlinear neural network for solving a class of constrained parametric optimization problems
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- An implementation of Karmarkar's algorithm for linear programming
- Presolving in linear programming
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- A family of linear programming algorithms based on an algorithm by von Neumann
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.
This page was built for publication: Hopfield neural networks in large-scale linear optimization problems
