Some convergence properties of descent methods
From MaRDI portal
Publication:1372548
DOI10.1023/A:1022691513687zbMATH Open0890.90167OpenAlexW165885430MaRDI QIDQ1372548FDOQ1372548
Authors: Zengxin Wei, Liqun Qi, Houyuan Jiang
Publication date: 22 June 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022691513687
Recommendations
- On the convergence of descent methods
- On the convergence of the descent methods
- Convergence theorems for continuous descent methods
- On the convergence of descent algorithms
- scientific article; zbMATH DE number 1545018
- scientific article; zbMATH DE number 1004164
- A study on the rate of convergence of descent methods
- scientific article; zbMATH DE number 5846393
- Convergence properties of descent methods for unconstrained minization
- scientific article; zbMATH DE number 2100286
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Convergence of some algorithms for convex minimization
- A class of iterative methods for solving nonlinear projection equations
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Full convergence of the steepest descent method with inexact line searches
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Local convergence of quasi-Newton methods for B-differentiable equations
- On Convergence Properties of Algorithms for Unconstrained Minimization
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Convergence of stationary sequences for variational inequalities with maximal monotone operators
- Title not available (Why is that?)
- Convergence properties of descent methods for unconstrained minization
Cited In (20)
- Global convergence of a modified gradient projection method for convex constrained problems
- A new trust region method with adaptive radius
- Title not available (Why is that?)
- Modified nonmonotone Armijo line search for descent method
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Title not available (Why is that?)
- Convergence of quasi-Newton method with new inexact line search
- Convergence properties of descent methods for unconstrained minization
- Title not available (Why is that?)
- Higher order curvature information and its application in a modified diagonal Secant method
- On the convergence of descent algorithms
- New inexact line search method for unconstrained optimization
- On the existence of affine invariant descent directions
- Title not available (Why is that?)
- Convergence of line search methods for unconstrained optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence
- On Convergence Properties of Algorithms for Unconstrained Minimization
- A study on the rate of convergence of descent methods
This page was built for publication: Some convergence properties of descent methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372548)