Steepest-descent failure analysis

McDermott, M.; Fowler, Wallace T.

doi:10.1007/bf00933050

Search citation statements

Order By: Relevance

Paper Sections

Select...

Steepest Descent Methods2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…was here presented for a Mayer problem of optimal control treated by using the penalty function method (Hestenes, time were treated by using a transformation approach, which introduces new independent and additional control variables has two main features: the algorithm is very simple, requiring a single numerical integration of the adjoint equations at each step, and some of the typical divergence problems described by McDermott and Fowler (1977) are circumvented.…”

Section: Steepest Descent Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A review of gradient algorithms for numerical computation of optimal trajectories

Golfetto¹,

Fernandes²

2012

JATM

View full text Add to dashboard Cite

Section: Steepest Descent Methodsmentioning

confidence: 99%

“…, which minimizes a scalar performance index in an optimization problem (Kelley, 1960;Bryson and Denham, 1962;McIntyre, 1968;McDermott and Fowler, 1977).…”

Section: Steepest Descent Methodsmentioning

confidence: 99%

A review of gradient algorithms for numerical computation of optimal trajectories

Golfetto¹,

Fernandes²

2012

JATM

View full text Add to dashboard Cite

A Numerical Study of Low‐Thrust Limited Power Trajectories between Coplanar Circular Orbits in an Inverse‐Square Force Field

Fernandes

Filho

Golfetto

2012

Mathematical Problems in Engineering

View full text Add to dashboard Cite

A numerical study of optimal low-thrust limited power trajectories for simple transfer (no rendezvous) between circular coplanar orbits in an inverse-square force field is performed by two different classes of algorithms in optimization of trajectories. This study is carried out by means of a direct method based on gradient techniques and by an indirect method based on the second variation theory. The direct approach of the trajectory optimization problem combines the main positive characteristics of two well-known direct methods in optimization of trajectories: the steepest-descent (first-order gradient) method and a direct second variation (second-order gradient) method. On the other hand, the indirect approach of the trajectory optimization problem involves two different algorithms of the well-known neighboring extremals method. Several radius ratios and transfer durations are considered, and the fuel consumption is taken as the performance criterion. For small-amplitude transfers, the results are compared to the ones provided by a linear analytical theory.

show abstract

Steepest-descent failure analysis

Cited by 2 publications

References 7 publications

A review of gradient algorithms for numerical computation of optimal trajectories

A review of gradient algorithms for numerical computation of optimal trajectories

A Numerical Study of Low‐Thrust Limited Power Trajectories between Coplanar Circular Orbits in an Inverse‐Square Force Field

Contact Info

Product

Resources

About