A New Algorithm To Solve Calculus Of Variations Problems Using Wolef's Convergence Theory,Part 1:Theory And Algorithm

DOI10.1080/02331939608844218zbMath0861.49019OpenAlexW2028102203MaRDI QIDQ5689845

No author found.

Publication date: 23 April 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844218

zbMATH Keywords

global convergencefinite terminationdescent algorithmWolfe's convergence theory

Mathematics Subject Classification ID

Numerical methods based on necessary conditions (49M05) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Numerical Solutions in the Simplest Problem of the Calculus of Variations