An alternative three-dimensional subspace method based on conic model for unconstrained optimization

DOI10.1051/RO/2023161MaRDI QIDQ6127656zbMATH OpenOpenAlexFDO

Authors Guoxin Wang, Zengxin Wei, Shengwei Yao

Publication date 14 April 2024

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2023161

zbMATH Keywords

global convergenceunconstrained optimizationsubspaceconic model

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• A subspace conjugate gradient algorithm for large-scale unconstrained optimization
• A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
• A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization
• A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
• An improved three-dimensional subspace minimization conjugate gradient method

This page was built for publication: An alternative three-dimensional subspace method based on conic model for unconstrained optimization

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