The Lagrange relaxation method in optimal control problems

MaRDI QIDQ1335803zbMATH OpenFDO

Authors S. I. Bigil'deyev, Yu. F. Golubev

Publication date 3 November 1994

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

Bolza optimal control problemLagrange multipliersnumerical relaxation algorithm

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Numerical optimization and variational techniques (65K10)

Review text

A normal Bolza optimal control problem is under consideration, i.e., it is assumed that in the Lagrange minimum principle the multiplier corresponding to the functional is nontrivial. The formula for variation of the functional is derived and a gradient-like minimization algorithm is proposed. Each iteration is accompanied with a correction procedure intended to improve control performance in the case when the dimension of the control exceeds the dimension of the state space. The argument is more heuristic than rigorous. However, it is claimed that the proposed algorithm helps to improve considerably performance of the energy saving control for a walking robot model.

Recommendations

• Lagrange lemma and the optimal control of diffusions. II: Nonlinear Lagrange functionals
• Suboptimal control: Steepest descent with respect to the Lagrangian
• scientific article; zbMATH DE number 978335
• scientific article; zbMATH DE number 2102025
• A general view to relaxation methods in control theory¹

Cited in

(4)

• A remark on controlled Lagrangian approach
• scientific article; zbMATH DE number 1094769 (Why is no real title available?)
• Principles and Practice of Constraint Programming – CP 2004
• The SILP-relaxation method in optimal control: General boundary conditions. II

This page was built for publication: The Lagrange relaxation method in optimal control problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335803)