The q-Gradient Vector for Unconstrained Continuous Optimization Problems

DOI10.1007/978-3-642-20009-0_58zbMath1421.90165OpenAlexW2181253127MaRDI QIDQ5232841

Aline C. Soterroni, Roberto Luiz Galski, Fernando Manuel Ramos

Publication date: 13 September 2019

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20009-0_58

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52)

Related Items

On \(q\)-BFGS algorithm for unconstrained optimization problems ⋮ Global optimization using \(q\)-gradients ⋮ Efficient time-varying \(q\)-parameter design for \(q\)-incremental least mean square algorithm with noisy links ⋮ Newton Like Line Search Method Using q-Calculus ⋮ q-Calculus Formalism for Non-extensive Particle Filter ⋮ \(q\)-state space least mean family of algorithms ⋮ On \(q\)-Newton's method for unconstrained multiobjective 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

Uses Software

• GEATbx

Cites Work

• A note on the \(q\)-derivative operator
• On \(q\)-Newton--Kantorovich method for solving systems of equations
• Frank Hilton Jackson
• Unnamed Item

This page was built for publication: The q-Gradient Vector for Unconstrained Continuous Optimization Problems