Abstract

AbstractIn this paper the application of the self‐scaling variable metric methods to optimal control problems is considered. The convergence of such methods in Hilbert space, both with and without line searches, is established for a wide class of convex functionals. The methods are then tested numerically on control problems, and the results are compared with earlier results for other variable metric algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call