A new algorithm for moving asymptotes for solving unconstrained optimization problems

zbMATH Open1265.90276MaRDI QIDQ4902079FDOQ4902079

Authors: Ping Hu, Zhaohui Jia, Qin Ni 

Publication date: 24 January 2013

Recommendations

• A new method of moving asymptotes for large-scale unconstrained optimization
• New conjugate gradient method for unconstrained optimization
• A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems
• A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
• A new hybrid conjugate gradient algorithm for unconstrained optimization

zbMATH Keywords

unconstrained optimizationseparable convex programsmoving asymptotes functionmethod of moving-asymptotes

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (3)

• A moving asymptotes algorithm using new local convex approximation methods with explicit solutions
• A new method of moving asymptotes for large-scale unconstrained optimization
• A new method of moving asymptotes for large-scale linearly equality-constrained minimization

This page was built for publication: A new algorithm for moving asymptotes for solving unconstrained optimization problems

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