An algorithm with explicit search directions based on line approximate subproblems for generalized box constrained optimization

zbMATH Open1240.90386MaRDI QIDQ3170084FDOQ3170084

Yuanxin Liang, Jinbao Jian, Qiao-fang Chen

Publication date: 29 September 2011

Recommendations

• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
• An active-set projected trust region algorithm for box constrained optimization problems
• A new generalized projection method of strongly sub-feasible directions for general constrained optimization
• A subspace modified PRP method for large-scale nonlinear box-constrained optimization
• scientific article; zbMATH DE number 1694901

zbMATH Keywords

optimizationalgorithm with explicit search directionsgeneralized box constraintsline subproblem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)

This page was built for publication: An algorithm with explicit search directions based on line approximate subproblems for generalized box constrained optimization

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