Descent methods with linesearch in the presence of perturbations

DOI10.1016/S0377-0427(97)00025-3zbMATH Open0877.65039OpenAlexW2089301577MaRDI QIDQ1360171FDOQ1360171

B. F. Svaiter, M. V. Solodov

Publication date: 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(97)00025-3

zbMATH Keywords

unconstrained optimizationperturbationslinesearchdescent algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Incremental gradient algorithms with stepsizes bounded away from zero
• Convergence analysis of perturbed feasible descent methods
• Minimization of functions having Lipschitz continuous first partial derivatives
• An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
• Inexact Newton Methods
• Enlarging the region of convergence of Newton's method for constrained optimization
• Incremental Least Squares Methods and the Extended Kalman Filter
• Error stability properties of generalized gradient-type algorithms
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• Full convergence of the steepest descent method with inexact line searches
• A Stability Analysis for Perturbed Nonlinear Iterative Methods
• Convergence of the steepest descent method for minimizing quasiconvex functions
• New inexact parallel variable distribution algorithms
• Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
• Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
• An auction algorithm for the max-flow problem

Cited In (4)

• Global convergence of the Dai-Yuan conjugate gradient method with perturbations
• On perturbed steepest descent methods with inexact line search for bilevel convex optimization
• Error stability properties of generalized gradient-type algorithms
• Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations

This page was built for publication: Descent methods with linesearch in the presence of perturbations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360171)