Sequential Conjugate Gradient-Restoration Algorithm for Optimal Control Problems with Nondifferential Constraints. Part 1. Theory.
Abstract
A sequential conjugate gradient-restoration algorithm is developed in order to solve optimal control problems involving a functional subject to differential constraints, nondifferential constraints, and terminal constraints. The algorithm is composed of a sequence of cycles, each cycle consisting of two phases, a conjugate gradient phase and a restoration phase. The conjugate gradient phase involves a single iteration and is designed to decrease the value of the functional while satisfying the constraints to first order. The restoration phase involves one or more iterations and is designed to restore the constraints to a predetermined accuracy, while the norm of the variations of the variations of the control and the parameter is minimized, subject to the linearized constraints. The sequential conjugate gradient-restoration algorithm is characterized by two main properties. First, at the end of each cycle, the trajectory satisfies the constraints to a given accuracy. Second, the conjugate gradient stepsize and the restoration stepsize can be chosen so that the restoration phase preserves the descent property of the conjugate gradient phase.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1977
- Accession Number
- ADA051102
Entities
People
- Angelo Miele
- B. P. Mohanty
- J. R. Cloutier
Organizations
- Rice University