Sliding Modes in Solving Convex Programming Problems
From MaRDI portal
Publication:4388929
Recommendations
Cited in
(16)- Vector method of design of sliding motion and simplex algorithms
- A continuous method for convex programming problems
- A survey of numerical methods for IVPs of ODEs with discontinuous right-hand side
- A Slime Mold Solver for Linear Programming Problems
- Sliding modes in the solution of a linear-quadratic game problem
- scientific article; zbMATH DE number 1424522 (Why is no real title available?)
- Support vector classifiers via gradient systems with discontinuous righthand sides
- Fundamental matrix solutions of piecewise smooth differential systems
- Slide reduction, revisited -- filling the gaps in SVP approximation
- On the dynamics of a differential inclusion built upon a nonconvex constrained minimization problem
- A variable structure convex programming based control approach for a class of uncertain linear systems
- Sliding mode optimization in dynamic LTI systems
- A discontinuous differential equation for the solution of quadratic programming Problems
- Slide reduction, successive minima and several~applications
- Ideal sliding mode in the problems of convex optimization
- Dynamical systems coupled with monotone set-valued operators: formalisms, applications, well-posedness, and stability
This page was built for publication: Sliding Modes in Solving Convex Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388929)