Skip to product information
Computational Methods in Optimal Control Problems (Softcover Reprint of the Original 1st 1970)

Computational Methods in Optimal Control Problems

$54.99
Shipping calculated at checkout.
  • Authorized Dealer
  • Ships within 1 business day
  • Free 30-Day Returns
  • Secure Checkout via Shopify Payments
Details

"Computational Methods in Optimal Control Problems" by I.H. Mufti is a mathematics book and learning resource focused on Core Mathematics. Best for teachers, students, and readers looking for stronger mathematical understanding.

The purpose of this modest report is to present in a simplified manner some of the computational methods that have been developed in the last ten years for the solution of optimal control problems. Only those methods that are based on the minimum (maximum) principle of Pontriagin are discussed here. The autline of the report is as follows: In the first two sections a control problem of Bolza is formulated and the necessary conditions in the form of the minimum principle are given. The method of steepest descent and a conjugate gradient-method are dis cussed in Section 3. In the remaining sections, the successive sweep method, the Newton-Raphson method and the generalized Newton-Raphson method (also called quasilinearization method) ar~ presented from a unified approach which is based on the application of Newton Raphson approximation to the necessary conditions of optimality. The second-variation method and other shooting methods based on minimizing an error function are also considered. TABLE OF CONTENTS 1. 0 INTRODUCTION 1 2. 0 NECESSARY CONDITIONS FOR OPTIMALITY •••••••• 2 3. 0 THE GRADIENT METHOD 4 3. 1 Min H Method and Conjugate Gradient Method •. •••••••••. . . . ••••••. ••••••••. • 8 3. 2 Boundary Constraints •••••••••••. ••••. • 9 3. 3 Problems with Control Constraints ••. •• 15 4. 0 SUCCESSIVE SWEEP METHOD •••••••••••••••••••• 18 4. 1 Final Time Given Implicitly ••••. •••••• 22 5. 0 SECOND-VARIATION METHOD •••••••••••••••••••• 23 6. 0 SHOOTING METHODS ••••••••••••••••••••••••••• 27 6. 1 Newton-Raphson Method ••••••••••••••••• 27 6.

Materials + Care

We prioritize quality in selecting the materials for our items, choosing premium fabrics and finishings that ensure durability, comfort, and timeless appeal.

Shipping + Returns

We strive to process and ship all orders in a timely manner, working diligently to ensure that your items are on their way to you as soon as possible.

Best For: Students and researchers interested in computational approaches to optimal control problems
Focus: Computational methods based on Pontryagin's minimum (maximum) principle for solving optimal control problems
Covers: Formulation of control problems of Bolza and necessary conditions derived from Pontryagin's principle
Why It Matters: Provides a simplified presentation of recent computational techniques for optimal control, aiding understanding and application in mathematical control theory

"Computational Methods in Optimal Control Problems" by I.H. Mufti is a mathematics book and learning resource focused on Core Mathematics. Best for teachers, students, and readers looking for stronger mathematical understanding.

Topic: Core Mathematics

Author: I.H. Mufti

Who this is for:

  • Teachers and classroom instructors
  • Students building subject mastery
  • Readers looking for practical learning support

Why this book matters: It stands out as a practical math resource that helps explain concepts, strengthen problem-solving, and support classroom or independent learning.

The purpose of this modest report is to present in a simplified manner some of the computational methods that have been developed in the last ten years for the solution of optimal control problems. Only those methods that are based on the minimum (maximum) principle of Pontriagin are discussed here. The autline of the report is as follows: In the first two sections a control problem of Bolza is formulated and the necessary conditions in the form of the minimum principle are given. The method of steepest descent and a conjugate gradient-method are dis cussed in Section 3. In the remaining sections, the successive sweep method, the Newton-Raphson method and the generalized Newton-Raphson method (also called quasilinearization method) ar~ presented from a unified approach which is based on the application of Newton Raphson approximation to the necessary conditions of optimality. The second-variation method and other shooting methods based on minimizing an error function are also considered. TABLE OF CONTENTS 1. 0 INTRODUCTION 1 2. 0 NECESSARY CONDITIONS FOR OPTIMALITY •••••••• 2 3. 0 THE GRADIENT METHOD 4 3. 1 Min H Method and Conjugate Gradient Method •. •••••••••. . . . ••••••. ••••••••. • 8 3. 2 Boundary Constraints •••••••••••. ••••. • 9 3. 3 Problems with Control Constraints ••. •• 15 4. 0 SUCCESSIVE SWEEP METHOD •••••••••••••••••••• 18 4. 1 Final Time Given Implicitly ••••. •••••• 22 5. 0 SECOND-VARIATION METHOD •••••••••••••••••••• 23 6. 0 SHOOTING METHODS ••••••••••••••••••••••••••• 27 6. 1 Newton-Raphson Method ••••••••••••••••• 27 6.

AuthorI.H. Mufti
PublisherSpringer
Published1970-01-01
ISBN-139783540049517
BindingPaperback
Pages49
LanguageEnglish
SubjectsMathematics
TopicCore Mathematics
SeriesLecture Notes in Economic and Mathematical Systems

Format: Paperback

Length: 49 pages

Language: English

Shop by collection

You might also like...