On the divergence of line search methods

zbMath1182.90099MaRDI QIDQ2379219

Walter F. Mascarenhas

Publication date: 19 March 2010

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

Full work available at URL: http://www.scielo.br/scielo.php?script=sci_abstract&pid=S1807-03022007000100006&lng=en&nrm=iso&tlng=en

zbMATH Keywords

convergenceline search methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (9)

Forward-backward quasi-Newton methods for nonsmooth optimization problems ⋮ On numerical solving the spherical separability problem ⋮ A simple canonical form for nonlinear programming problems and its use ⋮ Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence ⋮ Minimizing sequences in a constrained DC optimization problem ⋮ The divergence of the BFGS and Gauss Newton methods ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ The divergence of the barycentric Padé interpolants ⋮ Globally convergent Newton-type methods for multiobjective optimization

This page was built for publication: On the divergence of line search methods