Descent methods with linesearch in the presence of perturbations

DOI10.1016/S0377-0427(97)00025-3MaRDI QIDQ1360171zbMATH OpenOpenAlexFDO

Authors M. V. Solodov, B. F. Svaiter

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)

Recommendations

• Convergence of descent method without line search
• scientific article; zbMATH DE number 4106165
• A descent algorithm without line search for unconstrained optimization
• scientific article; zbMATH DE number 1960973
• scientific article; zbMATH DE number 1545018

Cites work

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