A predictive Min-H method to improve convergence to optimal solutions (Q4777952): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Steepest-Ascent Method for Solving Optimum Programming Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Search speed control strategies for the solution of optimal control problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Hybrid Computer Implementation of the Dynostat Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum Control, Inequality State Constraints, and the Generalized Newton-Raphson Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3849114 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5587509 / rank | |||
Normal rank | |||
Latest revision as of 15:23, 12 June 2024
scientific article; zbMATH DE number 3454418
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A predictive Min-H method to improve convergence to optimal solutions |
scientific article; zbMATH DE number 3454418 |
Statements
A predictive Min-H method to improve convergence to optimal solutions (English)
0 references
1974
0 references
0 references
