A q-conjugate gradient algorithm for unconstrained optimization problems

MaRDI QIDQ4992980zbMATH OpenFDO

Authors Kin Keung Lai, Bhagwat Ram, S. K. Mishra

Publication date 14 June 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/PJO/vol16/pjov17n1p57.pdf

zbMATH Keywords

\(q\)-calculusArmijo line searchconjugate gradient methoditerative algorithmunconstrained optimization

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Recommendations

• On \(q\)-BFGS algorithm for unconstrained optimization problems
• A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
• A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
• On \(q\)-Newton's method for unconstrained multiobjective optimization problems
• Newton like line search method using q-calculus

Cited in

(8)

• UOBYQA: unconstrained optimization by quadratic approximation
• On \(q\)-Newton's method for unconstrained multiobjective optimization problems
• A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
• On \(q\)-BFGS algorithm for unconstrained optimization problems
• A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
• An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
• Newton like line search method using q-calculus
• A modified Fletcher-Reeves conjugate gradient method for unconstrained optimization with applications in image restoration.

This page was built for publication: A \(q\)-conjugate gradient algorithm for unconstrained optimization problems

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