Skip to content

Latest commit

 

History

History
5 lines (3 loc) · 421 Bytes

README.md

File metadata and controls

5 lines (3 loc) · 421 Bytes

Cubic-Regularisation

This is an implementation of the adaptive regularisation algortihm using cubics (ARC), as developed by Cartis, Gould and Toint in their 2011 paper 'Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results'.

The main algortihm is contained in the function ARC.m. The script main.m contains an example of how to use the algortihm.