A general two-level subspace method for nonlinear optimization

DOI10.4208/JCM.1706-M2016-0721MaRDI QIDQ5381497zbMATH OpenOpenAlexFDO

Authors Cheng Chen, Zaiwen Wen, Yaxiang Yuan

Publication date 21 June 2019

Published in Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/jcm.1706-m2016-0721

zbMATH Keywords

convex and nonconvex problemslarge-scale problemsmultigrid/multilevel methodnonlinear optimizationsubspace technique

Mathematics Subject Classification ID

Discrete approximations in optimal control (49M25) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Programming in abstract spaces (90C48)

Recommendations

• A new subspace correction method for nonlinear unconstrained convex optimization problems
• scientific article; zbMATH DE number 992793
• A Subspace Study on Conjugate Gradient Algorithms
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
• Subspace methods for large scale nonlinear equations and nonlinear least squares

Cited in

(3)

• Optimal homotopy asymptotic method-least square for solving nonlinear fractional-order gradient-based dynamic system from an optimization problem
• A new subspace correction method for nonlinear unconstrained convex optimization problems
• Subspace methods for nonlinear optimization

This page was built for publication: A general two-level subspace method for nonlinear optimization

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