Papers › Neural-trust-region algorithm for unconstrained optimization (Part 1)
Neural-trust-region algorithm for unconstrained optimization (Part 1)
Mostafa Rezapour, Thomas Asaki
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper (part 1), we describe a derivative-free trust-region method for solving unconstrained optimization problems. We will discuss a method when we relax the model order assumption and use artificial neural network techniques to build a computationally relatively inexpensive model. We directly find an estimate of the objective function minimizer without explicitly constructing a model function. Therefore, we need to have the neural-network model derivatives, which can be obtained simply through a back-propagation process.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections