On Convergence Properties of Algorithms for Unconstrained Minimization
From MaRDI portal
DOI10.1093/IMANUM/9.3.435zbMATH Open0686.65032OpenAlexW2090175728MaRDI QIDQ4205014FDOQ4205014
Authors: Michael J. Todd 
Publication date: 1989
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/9.3.435
Recommendations
Cited In (19)
- Modified nonmonotone Armijo line search for descent method
- Convergence of quasi-Newton method with new inexact line search
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- A bracketing technique to ensure desirable convergence in univariate minimization
- On convergence of minimization methods: Attraction, repulsion, and selection
- Some convergence properties of descent methods
- Descentwise inexact proximal algorithms for smooth optimization
- Convergence of nonmonotone line search method
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- Uniform convergence for multi-valued algorithms
- How to deal with the unbounded in optimization: Theory and algorithms
- A modified Frank-Wolfe algorithm and its convergence properties
- Title not available (Why is that?)
- The extended generalized lambda distribution system for fitting distributions to data: history, completion of theory, tables, applications, the “final word” on moment fits
- New inexact line search method for unconstrained optimization
- Convergence of line search methods for unconstrained optimization
- Title not available (Why is that?)
- Convergence of descent method with new line search
- On an approach to the construction of algorithms for the unconditional minimization of pseudoconvex functions
This page was built for publication: On Convergence Properties of Algorithms for Unconstrained Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205014)
