Pages that link to "Item:Q1181368"
From MaRDI portal
The following pages link to Hamiltonian structure of dynamical systems which solve linear programming problems (Q1181368):
Displaying 12 items.
- A universal scaling theory for complexity of analog computation (Q716028) (← links)
- Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming (Q1325127) (← links)
- On explicit solvable gradient systems of Moser-Karmarkar type (Q1353807) (← links)
- Analog computation with dynamical systems (Q1586961) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- Matrix representation and gradient flows for NP-hard problems (Q1906756) (← links)
- Neurodynamical classifiers with low model complexity (Q2057774) (← links)
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory (Q2383193) (← links)
- Continuous dynamical systems that realize discrete optimization on the hypercube (Q2503628) (← links)
- The constrained Newton method on a Lie group and the symmetric eigenvalue problem (Q2564923) (← links)
- Scaling and universality of the complexity of analog computation (Q3531580) (← links)
- INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION (Q4502828) (← links)
