Dynamical Systems which Solve Optimization Problems with Linear Constraints
From MaRDI portal
Publication:3983458
DOI10.1093/imamci/8.2.135zbMath0747.90093OpenAlexW2033231393MaRDI QIDQ3983458
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
parametrizationdynamical systemstopological invariantssmooth manifoldbounded convex polyhedrondouble-bracket equations of Brockettsmall nonlinear and periodic perturbations
Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Linear programming (90C05) Application models in control theory (93C95)
Related Items
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 ⋮ On explicit solvable gradient systems of Moser-Karmarkar type ⋮ Random matrix theory for the analysis of the performance of an analog computer: a scaling theory ⋮ Matrix representation and gradient flows for NP-hard problems ⋮ Scaling and universality of the complexity of analog computation ⋮ Probabilistic analysis of a differential equation for linear programming ⋮ A universal scaling theory for complexity of analog computation ⋮ An optimization framework of biological dynamical systems ⋮ Neurodynamical classifiers with low model complexity ⋮ Time-varying continuous-time optimisation with pre-defined finite-time stability ⋮ A theory of complexity for continuous time systems ⋮ A Survey on Analog Models of Computation
