Dynamical Systems which Solve Optimization Problems with Linear Constraints
From MaRDI portal
Publication:3983458
Recommendations
Cited in
(20)- A theory of complexity for continuous time systems
- scientific article; zbMATH DE number 2068076 (Why is no real title available?)
- A Survey on Analog Models of Computation
- scientific article; zbMATH DE number 2183675 (Why is no real title available?)
- A universal scaling theory for complexity of analog computation
- Time-varying continuous-time optimisation with pre-defined finite-time stability
- A dynamic system approach to linear programming and its application in the economic simulation
- A dynamical system perspective on mathematical programming
- scientific article; zbMATH DE number 920751 (Why is no real title available?)
- On explicit solvable gradient systems of Moser-Karmarkar type
- An optimization framework of biological dynamical systems
- A Nash equilibrium solution in an oligopoly market: The search for Nash equilibrium solutions with replicator equations derived from the gradient dynamics of a simplex algorithm
- scientific article; zbMATH DE number 1330296 (Why is no real title available?)
- scientific article; zbMATH DE number 5252628 (Why is no real title available?)
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory
- Neurodynamical classifiers with low model complexity
- Matrix representation and gradient flows for NP-hard problems
- Probabilistic analysis of a differential equation for linear programming
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
- Scaling and universality of the complexity of analog computation
This page was built for publication: Dynamical Systems which Solve Optimization Problems with Linear Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983458)