Dissertation · 2024 · Open access

Optimization with Gradient Descent

Ghazalalsadat Parpinchi

Zenodo (CERN European Organization for Nuclear Research) · Published 19 January 2024 · DOI 10.5281/zenodo.17989999

Open full textCite this paper

In brief

“Optimization with Gradient Descent” is a 2024 dissertation by Ghazalalsadat Parpinchi, published in Zenodo (CERN European Organization for Nuclear Research). OpenAlex counts 0 citations as of 17 November 2026. It is open access under a CC BY licence: the full text is free to read at Zenodo (CERN European Organization for Nuclear Research).

Citations
0
Authors
1

Abstract

This Bachelor’s thesis focuses on gradient-based optimization algorithms for solving unconstrained minimization problems. The study begins with a review of fundamental concepts necessary to understand gradient descent and its mechanisms. The project analyzes the algorithm’s mathematical foundations, key components influencing convergence speed and accuracy, and explores potential modifications for unique problem settings. Additionally, the thesis investigates second-order optimization methods inspired by Newton’s method, which leverage second-order derivatives (e.g., the Hessian matrix) to enhance accuracy. To address the computational cost of second-order approaches, the conjugate gradient descent method is also examined. This work provides a comprehensive understanding of gradient descent algorithms and their variants, offering insights that can inform further research and practical applications in optimization and machine learning.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Parpinchi, G. (2024). Optimization with Gradient Descent. Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.17989999

MLA 9

Parpinchi, Ghazalalsadat. “Optimization with Gradient Descent.” Zenodo (CERN European Organization for Nuclear Research), 2024. https://doi.org/10.5281/zenodo.17989999.

Chicago

Parpinchi, Ghazalalsadat. 2024. “Optimization with Gradient Descent.” Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.17989999.

Harvard

Parpinchi, G. (2024) ‘Optimization with Gradient Descent’, Zenodo (CERN European Organization for Nuclear Research). doi:10.5281/zenodo.17989999.

IEEE

G. Parpinchi, “Optimization with Gradient Descent,” Zenodo (CERN European Organization for Nuclear Research), 2024, doi: 10.5281/zenodo.17989999.

BibTeX

@phdthesis{parpinchi2024optimization,
  title     = {{Optimization with Gradient Descent}},
  author    = {Parpinchi, Ghazalalsadat},
  year      = {2024},
  doi       = {10.5281/zenodo.17989999},
  url       = {https://doi.org/10.5281/zenodo.17989999}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques

  • gradient descent
  • unconstrained optimization
  • second-order optimization
  • Newton's method
  • Hessian matrix
  • conjugate gradient method
  • convergence rate
  • optimization algorithms

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Parpinchi, G. (2024). Optimization with Gradient Descent. Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.17989999

How many times has this paper been cited?

0 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Zenodo (CERN European Organization for Nuclear Research): sign in and open the full text from this page.

Who wrote this paper?

Ghazalalsadat Parpinchi.

What is the DOI of this paper?

10.5281/zenodo.17989999, permanently at https://doi.org/10.5281/zenodo.17989999. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.