How much do approximate derivatives hurt filter methods?

DOI10.1051/ro/2009016zbMath1175.65074OpenAlexW2142887070MaRDI QIDQ3398592

Caroline Sainvitu

Publication date: 29 September 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105437

zbMATH Keywords

unconstrained optimizationnumerical resultsapproximate derivativestrust-region algorithmsfilter techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items

Rapidly convergent Steffensen-based methods for unconstrained optimization

Uses Software

• GALAHAD
• L-BFGS
• CUTEr
• DFO
• LBFGS-B
• Filtrane
• HSL-VF05

Cites Work

• Sensitivity of trust-region algorithms to their parameters
• On the limited memory BFGS method for large scale optimization
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• Recent progress in unconstrained nonlinear optimization without derivatives
• Matrix conditioning and nonlinear optimization
• Trust Region Methods
• A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
• Solving the Trust-Region Subproblem using the Lanczos Method
• A Limited Memory Algorithm for Bound Constrained Optimization
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• CUTEr and SifDec
• A Filter-Trust-Region Method for Unconstrained Optimization
• Benchmarking optimization software with performance profiles.
• Nonlinear programming without a penalty function.