Sliding Modes in Solving Convex Programming Problems

@inproceedings{GLAZOS1998SlidingMI,
title={Sliding Modes in Solving Convex Programming Problems},
author={MICHAEL P. GLAZOS and Stefen Hui and Stanislaw H. Zak},
year={1998}
}

Sliding modes are used to analyze a class of dynamical systems that solve convex programming problems. The analysis is carried out using concepts from the theory of differential equations with discontinuous right-hand sides and Lyapunov stability theory. It is shown that the equilibrium points of the system coincide with the minimizers of the convex programming problem, and that irrespective of the initial state of the system the state trajectory converges to the solution set of the problem… CONTINUE READING

A dynamical systems approach to solving linear programming problems

S. H. ŻAK, V. UPATISING, W. E. LILLO, S. HUI

Differential Equations, Dynamical Systems, and Control Science: A Festschrift in Honor of Lawrence Markus, Chap. 54, Lecture Notes in Pure and Appl. Math. 152, K. D. Elworthy, W. N. Everitt, and E. B. Lee, eds., Marcel Dekker, New York • 1994

Neural networks for constrained optimization problems