Newton Like Line Search Method Using q-Calculus
From MaRDI portal
Publication:5115000
DOI10.1007/978-981-10-4642-1_17zbMath1442.65109OpenAlexW2606897751MaRDI QIDQ5115000
Geetanjali Panda, Suvra Kanti Chakraborty
Publication date: 29 June 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-10-4642-1_17
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) (q)-calculus and related topics (05A30)
Related Items (4)
On \(q\)-BFGS algorithm for unconstrained optimization problems ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of a symmetric matrix
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Variational \(q\)-calculus.
- Integral inequalities in \(q\)-calculus
- Applications of \(q\)-Taylor theorems
- The \(q\)-version of a theorem of Bochner
- On \(q\)-Newton--Kantorovich method for solving systems of equations
- A 𝑞-sampling theorem related to the 𝑞-Hankel transform
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- On q-Analogues of the Fourier and Hankel Transforms
- Applications of q-Calculus in Operator Theory
- The q-Gradient Vector for Unconstrained Continuous Optimization Problems
This page was built for publication: Newton Like Line Search Method Using q-Calculus
