Greatest descent algorithms in unconstrained optimization
From MaRDI portal
Publication:1035932
DOI10.1007/S10957-009-9533-4zbMATH Open1175.90370OpenAlexW2053902925MaRDI QIDQ1035932FDOQ1035932
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
unconstrained optimizationNewton methodgreatest descent directionLevenberg-Marquardt formulatwo-dimensional search directions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Optimization
- Two-Point Step Size Gradient Methods
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Alternate step gradient method*
- Algorithms for unconstrained optimization problems via control theory
- Gradient Transformation Trajectory Following Algorithms for Determining Stationary Min-Max Saddle Points
Cited In (6)
- Approximate greatest descent methods for optimization with equality constraints
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
- On the rate of convergence of projected BarzilaiโBorwein methods
- 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
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- A descent algorithm for nonsmooth convex optimization ๐ ๐
- Global descent methods for unconstrained global optimization ๐ ๐
- Convergence of implementable descent algorithms for unconstrained optimization ๐ ๐
- Sufficient descent directions in unconstrained optimization ๐ ๐
- A simple sufficient descent method for unconstrained optimization ๐ ๐
- A descent algorithm without line search for unconstrained optimization ๐ ๐
- Algoritmi per problemi di ottimo non vincolato ๐ ๐
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)