Greatest descent algorithms in unconstrained optimization

DOI10.1007/S10957-009-9533-4zbMATH Open1175.90370OpenAlexW2053902925MaRDI QIDQ1035932FDOQ1035932

Authors: B. S. Goh 

Publication date: 4 November 2009

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-009-9533-4

Recommendations

• scientific article; zbMATH DE number 5072445
• A descent method for unconstrained optimization problems
• Global descent methods for unconstrained global optimization
• Algoritmi per problemi di ottimo non vincolato
• Sufficient descent directions in unconstrained optimization
• A simple sufficient descent method for unconstrained optimization
• Convergence of implementable descent algorithms for unconstrained optimization
• A descent algorithm without line search for unconstrained optimization
• scientific article; zbMATH DE number 465313
• A descent algorithm for nonsmooth convex optimization

zbMATH Keywords

unconstrained optimizationNewton methodgreatest descent directionLevenberg-Marquardt formulatwo-dimensional search directions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Cites Work

• Numerical Optimization
• Title not available (Why is that?)
• Two-Point Step Size Gradient Methods
• Step-sizes for the gradient method
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• Alternate step gradient method*
• Title not available (Why is that?)
• Algorithms for unconstrained optimization problems via control theory
• Gradient Transformation Trajectory Following Algorithms for Determining Stationary Min-Max Saddle Points

Cited In (7)

• Approximate greatest descent methods for optimization with equality constraints
• On the rate of convergence of projected Barzilai-Borwein methods
• On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
• Approximate greatest descent method and quasi-Newton matrices in optimization
• On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization
• Approximate greatest descent in neural network optimization
• Convergence and stability of line search methods for unconstrained optimization

Uses Software

• KELLEY

This page was built for publication: Greatest descent algorithms in unconstrained optimization

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