Sliding Modes in Solving Convex Programming Problems
Authors:
- Michael P. GlazosMGMichael P. Glazos
- Stefen HuiSHStefen Hui
- Stanislaw H. ZakSZStanislaw H. Zak
- 1 March 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 36 (2) , 680-697
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.Keywords
This publication has 17 references indexed in Scilit:
- Neural networks for constrained optimization problemsInternational Journal of Circuit Theory and Applications, 1993
- On solving constrained optimization problems with neural networks: a penalty method approachIEEE Transactions on Neural Networks, 1993
- Path-Following Methods for Linear ProgrammingSIAM Review, 1992
- Solving Convex Programs by Means of Ordinary Differential EquationsMathematics of Operations Research, 1992
- Neural networks for nonlinear programmingIEEE Transactions on Circuits and Systems, 1988
- Differential Equations with Discontinuous Righthand Sides1988
- Numerical Optimization Techniques1985
- Nonlinear programming without computationIEEE Transactions on Circuits and Systems, 1984
- Necessary and sufficient conditions for a penalty method to be exactMathematical Programming, 1975
- Using sliding modes in static optimization and nonlinear programmingAutomatica, 1974