Sliding Modes in Solving Convex Programming Problems

DOI10.1137/S0363012993255880zbMATH Open0911.93023OpenAlexW1970081682MaRDI QIDQ4388929FDOQ4388929

Authors: Michael P. Glazos, Stefen Hui, Stanislaw H. Żak 

Publication date: 10 May 1998

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0363012993255880

Recommendations

• Ideal sliding mode in the problems of convex optimization
• A discontinuous differential equation for the solution of quadratic programming Problems
• Solving cone-constrained convex programs by differential inclusions
• Solving Convex Programs by Means of Ordinary Differential Equations

zbMATH Keywords

stabilityconvex programmingdifferential inclusionsliding modenonsmooth penalty functionFilippov's trajectoriessubdifferential of the penalized functional

Mathematics Subject Classification ID

Ordinary differential inclusions (34A60) Variable structure systems (93B12) Control/observation systems in abstract spaces (93C25)

Cited In (16)

• A continuous method for convex programming problems
• Title not available (Why is that?)
• Slide reduction, successive minima and several~applications
• A Slime Mold Solver for Linear Programming Problems
• Support vector classifiers via gradient systems with discontinuous righthand sides
• A survey of numerical methods for IVPs of ODEs with discontinuous right-hand side
• Fundamental matrix solutions of piecewise smooth differential systems
• Sliding mode optimization in dynamic LTI systems
• Dynamical systems coupled with monotone set-valued operators: formalisms, applications, well-posedness, and stability
• Slide reduction, revisited -- filling the gaps in SVP approximation
• A variable structure convex programming based control approach for a class of uncertain linear systems
• A discontinuous differential equation for the solution of quadratic programming Problems
• Vector method of design of sliding motion and simplex algorithms
• On the dynamics of a differential inclusion built upon a nonconvex constrained minimization problem
• Ideal sliding mode in the problems of convex optimization
• Sliding modes in the solution of a linear-quadratic game problem

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)