A computational approach to the maximum principle (Q2265658)

From MaRDI portal

Revision as of 14:01, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A computational approach to the maximum principle	scientific article

Statements

scholarly article

0 references

A computational approach to the maximum principle (English)

0 references

A. V. Balakrishnan

0 references

Journal of Computer and System Sciences

0 references

publication date

1971

0 references

MaRDI profile type

MaRDI publication profile

0 references

On a New Computing Technique in Optimal Control

0 references

Multiplier and gradient methods

0 references

A constructive approach to the maximum principle for differential- difference problems using the Balakrishnan's \(\varepsilon\)-technique

0 references

A Generalization of the Method of Balakrishnan: Inequality Constraints and Initial Conditions

0 references

Numerical Solution of Dynamical Optimization Problems

0 references

0 references

A new computing technique in system identification

0 references

0 references

0 references

Relaxed Controls and Variational Problems

0 references

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0022-0000(71)80032-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2265658

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2265658&oldid=34559184"