Arc-search in numerical optimization

zbMATH Open1389.90240MaRDI QIDQ5367661FDOQ5367661

Authors: Yiguang Yang 

Publication date: 20 October 2017

Recommendations

• Efficient Line Search Methods for Convex Functions
• scientific article; zbMATH DE number 1186893
• A nonmonotone trust region technique for unconstrained optimization problems
• A new modified trust region algorithm for solving unconstrained optimization problems
• A class of nonmonotone trust region algorithms for constrained optimizations

zbMATH Keywords

linear programmingconstrained optimizationunconstrained optimizationnumerical optimizationarc-searchconvex quadratic programming

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Convex programming (90C25) Linear programming (90C05)

Cited In (4)

• A discussion on variational analysis in derivative-free optimization
• Across neighborhood search for numerical optimization
• Rudimentary considerations for effective line search method in nonlinear finite element analysis
• How mature is nonlinear optimization?

This page was built for publication: Arc-search in numerical optimization

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