Sliding Modes in Solving Convex Programming Problems

Authors:
Michael P. Glazos;Stefen Hui;Stanislaw H. Zak
Affiliations:
-;-;-
Venue:
SIAM Journal on Control and Optimization
Year:
1998

Citing 0
Cited 6

Neurodynamical Optimization

Journal of Global Optimization
Support vector classifiers via gradient systems with discontinuous righthand sides

Neural Networks
Control Liapunov function design of neural networks that solve convex optimization and variational inequality problems

Neurocomputing
A new one-layer neural network for linear and quadratic programming

IEEE Transactions on Neural Networks
Fundamental matrix solutions of piecewise smooth differential systems

Mathematics and Computers in Simulation
A survey of numerical methods for IVPs of ODEs with discontinuous right-hand side

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. The dynamic behavior of the systems is illustrated by two numerical examples.