A deterministic annealing neural network for convex programming
From MaRDI portal
Publication:1345262
DOI10.1016/0893-6080(94)90041-8zbMath0818.90090OpenAlexW1991832796MaRDI QIDQ1345262
Publication date: 28 February 1995
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0893-6080(94)90041-8
convergence analysisrecurrent neural networkasymptotic stabilitydeterministic annealing neural network
Convex programming (90C25) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items (32)
A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS ⋮ A multilayer recurrent neural network for on-line synthesis of minimum-norm linear feedback control systems via pole assignment ⋮ Metaheuristics: A bibliography ⋮ Solving convex programming problems with equality constaints by neural networks ⋮ A nonnegative matrix factorization algorithm based on a discrete-time projection neural network ⋮ A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem ⋮ A one-layer recurrent neural network for constrained nonconvex optimization ⋮ Neural network for constrained nonsmooth optimization using Tikhonov regularization ⋮ Robust multiple-fault detection and isolation: A gradient flow approach ⋮ A recurrent neural network for adaptive beamforming and array correction ⋮ Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ A neurodynamic optimization approach to supervised feature selection via fractional programming ⋮ A recurrent neural network for nonlinear fractional programming ⋮ A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization ⋮ A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints ⋮ A recurrent neural network for solving a class of generalized convex optimization problems ⋮ A one-layer recurrent neural network for constrained nonsmooth invex optimization ⋮ A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming ⋮ A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints ⋮ Recurrent neural networks for computing weighted Moore-Penrose inverse ⋮ On the global output convergence of a class of recurrent neural networks with time-varying inputs ⋮ A neurodynamic approach to convex optimization problems with general constraint ⋮ A new neural network for solving linear programming problems ⋮ An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function ⋮ Primal-dual solution for the linear programming problems using neural networks ⋮ A collective neurodynamic optimization approach to bound-constrained nonconvex optimization ⋮ Augmented gradient flows for on-line robust pole assignment via state and output feedback ⋮ A neural network approach to solve geometric programs with joint probabilistic constraints ⋮ A gradient flow approach to on-line robust pole assignment for synthesizing output feedback control systems ⋮ A dual neural network for convex quadratic programming subject to linear equality and inequality constraints ⋮ Differential-algebraic approach to linear programming
Cites Work
- ``Neural computation of decisions in optimization problems
- Delay structure conditions for identifiability of closed loop systems
- Recurrent neural networks for linear programming: Analysis and design principles
- Unifying the Tank and Hopfield linear programming circuit and the canonical nonlinear programming circuit of Chua and Lin
- Analysis and design of a recurrent neural network for linear programming
This page was built for publication: A deterministic annealing neural network for convex programming
