scientific article; zbMATH DE number 1497138

MaRDI QIDQ4498865zbMATH OpenFDO

Authors Rolf Felkel

Publication date 29 March 2001

zbMATH Keywords

algorithmlinesearch methodnumerical resultssecond-order informationtruncated Lanczos decompositionunconstrained and bound constrained minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Recommendations

• A limited-memory multipoint symmetric secant method for bound constrained optimization
• A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
• An active set feasible method for large-scale minimization problems with bound constraints
• An active set limited memory BFGS algorithm for large-scale bound constrained optimization
• An active set truncated Newton method for large-scale bound constrained optimization

Cited in

(1)

• Smoothed penalty algorithms for optimization of nonlinear models

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4498865)