The gradient projection method with exact line search
DOI10.1023/B:JOGO.0000049118.13265.9BzbMATH Open1136.90513OpenAlexW2043394374MaRDI QIDQ1768632FDOQ1768632
Authors: William Hager, Soonchul Park 
Publication date: 15 March 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jogo.0000049118.13265.9b
Recommendations
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Cited In (11)
- A probe method of gradient projection type
- The Gradient Projection Method Using Curry’s Steplength
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- On the rate of convergence of projected Barzilai-Borwein methods
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
- The radar method: An effective line search for piecewise linear concave functions
- Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- A survey on the continuous nonlinear resource allocation problem
This page was built for publication: The gradient projection method with exact line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768632)
