The q-gradient vector for unconstrained continuous optimization problems
From MaRDI portal
The \(q\)-gradient vector for unconstrained continuous optimization problems
Recommendations
- On q-steepest descent method for unconstrained multiobjective optimization problems
- Global optimization using \(q\)-gradients
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- Newton like line search method using q-calculus
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
Cites work
Cited in
(11)- On q-steepest descent method for unconstrained multiobjective optimization problems
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- On \(q\)-BFGS algorithm for unconstrained optimization problems
- \(q\)-state space least mean family of algorithms
- Efficient time-varying q-parameter design for q-incremental least mean square algorithm with noisy links
- Global optimization using \(q\)-gradients
- Newton like line search method using q-calculus
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- \(q\)-calculus formalism for non-extensive particle filter
- New representations of Pascal matrix via operational q-calculus
This page was built for publication: The \(q\)-gradient vector for unconstrained continuous optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232841)