A hybrid steepest descent method for constrained convex optimization

DOI10.1016/j.automatica.2008.08.018zbMath1158.93329OpenAlexW2028193232WikidataQ108430612 ScholiaQ108430612MaRDI QIDQ1012884

Mathieu Gerard, Verhaegen, Michel, Bart De Schutter

Publication date: 23 April 2009

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2008.08.018

zbMATH Keywords

convex optimizationhybrid systemsgradient methodssteepest descent methodreal-time optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A non-penalty recurrent neural network for solving a class of constrained optimization problems ⋮ Optimal Distribution Control Of Non-Linear Tire Force Of Electric Vehicles With In-Wheel Motors ⋮ A differential inclusion-based approach for solving nonsmooth convex optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model predictive control: Theory and practice - a survey
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• System theory for numerical analysis
• Optimization and nonsmooth analysis
• Robust adaptive LQ control schemes
• Lyapunov stability theory of nonsmooth systems
• Model predictive control based on linear programming - the explicit solution
• Control Perspectives on Numerical Algorithms and Matrix Problems