Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method

DOI10.1016/0898-1221(92)90068-SzbMath0773.49015OpenAlexW2053536890MaRDI QIDQ1187800

S. Singh

Publication date: 13 August 1992

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(92)90068-s

zbMATH Keywords

unconstrained minimizationdynamic optimizationpenalty functionSnyman's algorithm

Mathematics Subject Classification ID

Related Items (6)

A dynamic penalty function method for the solution of structural optimization problems ⋮ Using mathematical optimization in the CFD analysis of a continuous quenching process ⋮ The influence of joint angle constraints on the optimum design of a planar robot manipulator following a complicated prescribed path ⋮ Using CFD and mathematical optimization to investigate air pollution due to stacks ⋮ A mathematical optimization methodology for the optimal design of a planar robotic manipulator ⋮ The LFOPC leap-frog algorithm for constrained optimization

Cites Work

• An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
• Control parametrization: a unified approach to optimal control problems with general constraints
• A convergent dynamic method for large minimization problems
• Optimal control of container cranes
• A new and dynamic method for unconstrained minimization
• An approach to nonlinear programming
• UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method