Dynamical Systems which Solve Optimization Problems with Linear Constraints

DOI10.1093/IMAMCI/8.2.135zbMATH Open0747.90093OpenAlexW2033231393MaRDI QIDQ3983458FDOQ3983458

Authors: L. Faybusovich 

Publication date: 27 June 1992

Published in: IMA Journal of Mathematical Control and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamci/8.2.135

Recommendations

• Publication:4890951
• Convex Optimization Via Feedbacks
• Hamiltonian structure of dynamical systems which solve linear programming problems

zbMATH Keywords

dynamical systemsparametrizationtopological invariantssmooth manifoldbounded convex polyhedrondouble-bracket equations of Brockettsmall nonlinear and periodic perturbations

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Fractional programming (90C32) Sensitivity, stability, parametric optimization (90C31) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Application models in control theory (93C95)

Cited In (20)

• Title not available (Why is that?)
• A Survey on Analog Models of Computation
• Title not available (Why is that?)
• Time-varying continuous-time optimisation with pre-defined finite-time stability
• A universal scaling theory for complexity of analog computation
• A dynamic system approach to linear programming and its application in the economic simulation
• A dynamical system perspective on mathematical programming
• Title not available (Why is that?)
• On explicit solvable gradient systems of Moser-Karmarkar type
• An optimization framework of biological dynamical systems
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• A theory of complexity for continuous time systems

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)