Pages that link to "Item:Q1345262"
From MaRDI portal
The following pages link to A deterministic annealing neural network for convex programming (Q1345262):
Displaying 30 items.
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization (Q448288) (← links)
- A recurrent neural network for solving a class of generalized convex optimization problems (Q459437) (← links)
- A one-layer recurrent neural network for constrained nonsmooth invex optimization (Q470180) (← links)
- A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints (Q508218) (← links)
- On the global output convergence of a class of recurrent neural networks with time-varying inputs (Q557639) (← links)
- An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function (Q781395) (← links)
- A one-layer recurrent neural network for constrained nonconvex optimization (Q889340) (← links)
- Neural network for constrained nonsmooth optimization using Tikhonov regularization (Q889405) (← links)
- Solving convex programming problems with equality constaints by neural networks (Q1125028) (← links)
- A new neural network for solving linear programming problems (Q1268155) (← links)
- Augmented gradient flows for on-line robust pole assignment via state and output feedback (Q1596481) (← links)
- A dual neural network for convex quadratic programming subject to linear equality and inequality constraints (Q1600289) (← links)
- A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints (Q1718034) (← links)
- A gradient flow approach to on-line robust pole assignment for synthesizing output feedback control systems (Q1858868) (← links)
- Differential-algebraic approach to linear programming (Q1862190) (← links)
- A multilayer recurrent neural network for on-line synthesis of minimum-norm linear feedback control systems via pole assignment (Q1915013) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A recurrent neural network for nonlinear fractional programming (Q1955212) (← links)
- A neural network approach to solve geometric programs with joint probabilistic constraints (Q2104380) (← links)
- A nonnegative matrix factorization algorithm based on a discrete-time projection neural network (Q2179837) (← links)
- A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem (Q2185714) (← links)
- A neurodynamic approach to convex optimization problems with general constraint (Q2281692) (← links)
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization (Q2339416) (← links)
- A recurrent neural network for adaptive beamforming and array correction (Q2418200) (← links)
- Primal-dual solution for the linear programming problems using neural networks (Q2570701) (← links)
- A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS (Q3174017) (← links)
- A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming (Q5387456) (← links)
- Cardinality-constrained portfolio selection based on collaborative neurodynamic optimization (Q6055161) (← links)
- Sparse signal reconstruction via collaborative neurodynamic optimization (Q6076704) (← links)
- A neurodynamic optimization approach to supervised feature selection via fractional programming (Q6078682) (← links)