A deterministic annealing neural network for convex programming

DOI10.1016/0893-6080(94)90041-8zbMATH Open0818.90090OpenAlexW1991832796MaRDI QIDQ1345262FDOQ1345262

Authors: Jun Wang 

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

Recommendations

• Solving convex programming problems with equality constaints by neural networks
• A recurrent neural network for solving convex quadratic program
• A new nonlinear neural network for solving convex nonlinear programming problems
• Application of projection neural network in solving convex programming problems
• A dynamic system model for solving convex nonlinear optimization problems

zbMATH Keywords

asymptotic stabilityconvergence analysisrecurrent neural networkdeterministic annealing neural network

Mathematics Subject Classification ID

Convex programming (90C25) Neural networks for/in biological studies, artificial life and related topics (92B20)

Cites Work

• ``Neural computation of decisions in optimization problems
• Analysis and design of a recurrent neural network for linear programming
• Delay structure conditions for identifiability of closed loop systems
• Unifying the Tank and Hopfield linear programming circuit and the canonical nonlinear programming circuit of Chua and Lin
• Recurrent neural networks for linear programming: Analysis and design principles

Cited In (36)

• A neurodynamic approach to convex optimization problems with general constraint
• A neural network approach to solve geometric programs with joint probabilistic constraints
• Differential-algebraic approach to linear programming
• A multilayer recurrent neural network for on-line synthesis of minimum-norm linear feedback control systems via pole assignment
• Partially annealed neural networks
• On the global output convergence of a class of recurrent neural networks with time-varying inputs
• Annealing Optimization for Progressive Learning With Stochastic Approximation
• Recurrent neural networks for computing weighted Moore-Penrose inverse
• A new neural network for solving linear programming problems
• Solving the production transportation problem via a deterministic annealing neural network method
• Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization
• A neurodynamic optimization approach to supervised feature selection via fractional programming
• Solving convex programming problems with equality constaints by neural networks
• A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming
• A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
• A collaborative neurodynamic approach with two-timescale projection neural networks designed via majorization-minimization for global optimization and distributed global optimization
• Sparse signal reconstruction via collaborative neurodynamic optimization
• A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
• A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
• A recurrent neural network for solving a class of generalized convex optimization problems
• 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 one-layer recurrent neural network for constrained nonsmooth invex optimization
• A gradient flow approach to on-line robust pole assignment for synthesizing output feedback control systems
• Primal-dual solution for the linear programming problems using neural networks
• A nonnegative matrix factorization algorithm based on a discrete-time projection neural network
• An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function
• A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
• A recurrent neural network for nonlinear fractional programming
• A recurrent neural network for adaptive beamforming and array correction
• Metaheuristics: A bibliography
• A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints
• Augmented gradient flows for on-line robust pole assignment via state and output feedback
• A novel recurrent neural network for solving MLCPs and its application to linear and quadratic programming problems
• A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints

This page was built for publication: A deterministic annealing neural network for convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345262)