Pages that link to "Item:Q2371989"
From MaRDI portal
The following pages link to Application of projection neural network in solving convex programming problems (Q2371989):
Displaying 28 items.
- A practical nonlinear dynamic framework for solving a class of fractional programming problems (Q330727) (← links)
- Solving a class of geometric programming problems by an efficient dynamic model (Q391472) (← links)
- A capable neural network model for solving the maximum flow problem (Q425347) (← links)
- Neural networks for solving second-order cone constrained variational inequality problem (Q429451) (← links)
- A dynamic system model for solving convex nonlinear optimization problems (Q430477) (← links)
- A generalized neural network for solving a class of minimax optimization problems with linear constraints (Q433302) (← links)
- An efficient dynamic model for solving a portfolio selection with uncertain chance constraint models (Q515750) (← links)
- A dynamical model for solving degenerate quadratic minimax problems with constraints (Q654740) (← links)
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints (Q726145) (← links)
- A computational intelligence method for solving a class of portfolio optimization problems (Q894382) (← links)
- Solving convex programming problems with equality constaints by neural networks (Q1125028) (← links)
- A deterministic annealing neural network for convex programming (Q1345262) (← links)
- A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems (Q1631447) (← links)
- A novel neural network for solving semidefinite programming problems with some applications (Q1713177) (← links)
- A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints (Q1718034) (← links)
- A projection neural network for circular cone programming (Q1720929) (← links)
- A novel method to handle inequality constraints for convex programming neural network (Q1857753) (← links)
- A nonlinear projection neural network for solving interval quadratic programming problems and its stability analysis (Q1958828) (← links)
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems (Q2269819) (← links)
- Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions (Q2298441) (← links)
- A new class of interval projection neural networks for solving interval quadratic program (Q2477325) (← links)
- A new neural network for solving nonlinear projection equations (Q2643775) (← links)
- The optimization technique for solving a class of non-differentiable programming based on neural network method (Q2655120) (← links)
- A new method for solving split equality problems via projection dynamical systems (Q2661687) (← links)
- A dynamical system method for solving the split convex feasibility problem (Q2666702) (← links)
- A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS (Q3174017) (← links)
- Projection type neural network and its convergence analysis (Q3181336) (← links)
- A new fixed-time stability of neural network to solve split convex feasibility problems (Q6498621) (← links)
