Numerical solution of a relaxed control problem by the epsilon method

DOI10.1007/BF00934703MaRDI QIDQ1143345zbMATH OpenFDO

Authors S. H. Smith

Publication date 1981

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convergencenumerical solutionrelaxed controlepsilon method

Mathematics Subject Classification ID

Optimality conditions for problems involving ordinary differential equations (49K15) Numerical methods of relaxation type (49M20)

Cites work

• A Generalization of the Method of Balakrishnan: Inequality Constraints and Initial Conditions
• A computation aspect of the epsilon method
• Application of relaxed solutions to minimum sensitivity optimal control
• Application of the epsilon technique to the identification of distributed parameter systems
• On a New Computing Technique in Optimal Control
• On a new computing technique in optimal control and its application to minimal-time flight profile optimization
• Optimization: Application of the epsilon method

Cited in

(2)

• A computational method for a class of optimal relaxed control problems
• Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints

This page was built for publication: Numerical solution of a relaxed control problem by the epsilon method

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