A new unconstrained optimization method for imprecise function and gradient values
From MaRDI portal
The paper presents a numerical algorithm for computing the minimum of a function of \(n\) real variables, based on one-dimensional bisections. They give various numerical results.
Cited in
(16)- From linear to nonlinear iterative methods
- Convergence of line search methods for unconstrained optimization
- Locating, characterizing and computing the stationary points of a function
- A dimension-reducing method for unconstrained optimization
- OPTAC: A portable software package for analyzing and comparing optimization methods by visualization
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- The non-monotone conic algorithm
- ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH
- A note on solution of nonlinear programming problems with imprecise function and gradient values
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
- Modified nonmonotone Armijo line search for descent method
- Optimized explicit Runge-Kutta pair of orders 9(8)
- Artificial nonmonotonic neural networks
- Convergence of descent method with new line search
- Convergence of quasi-Newton method with new inexact line search
- New inexact line search method for unconstrained optimization
This page was built for publication: A new unconstrained optimization method for imprecise function and gradient values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916739)
