A new unconstrained optimization method for imprecise function and gradient values

DOI10.1006/jmaa.1996.0041zbMath0887.90166OpenAlexW2151778798MaRDI QIDQ1916739

Michael N. Vrahatis, G. E. Manoussakis, G. S. Androulakis

Publication date: 14 July 1996

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/74c6edd35960cdbe7a1aaad771ed9efd36b5430c

zbMATH Keywords

relaxationone-dimensional bisections

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods of relaxation type (49M20)

Related Items (15)

Convergence of quasi-Newton method with new inexact line search ⋮ From linear to nonlinear iterative methods ⋮ Convergence of line search methods for unconstrained optimization ⋮ New inexact line search method 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 ⋮ Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions ⋮ A class of gradient unconstrained minimization algorithms with adaptive stepsize ⋮ Modified nonmonotone Armijo line search for descent method ⋮ Optimized explicit Runge-Kutta pair of orders \(9(8)\) ⋮ The non-monotone conic algorithm ⋮ ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH ⋮ Artificial nonmonotonic neural networks ⋮ Convergence of descent method with new line search

This page was built for publication: A new unconstrained optimization method for imprecise function and gradient values