An improved multi-step gradient-type method for large scale optimization
From MaRDI portal
Publication:640533
DOI10.1016/j.camwa.2011.04.030zbMath1222.90044OpenAlexW2069271360MaRDI QIDQ640533
Wah June Leong, Mahboubeh Farid
Publication date: 18 October 2011
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: http://psasir.upm.edu.my/id/eprint/24643/1/An%20improved%20multi.pdf
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52)
Related Items (3)
Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization ⋮ A class of diagonal quasi-Newton methods for large-scale convex minimization ⋮ Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- A new two-step gradient-type method for large-scale unconstrained optimization
- A monotone gradient method via weak secant equation for unconstrained optimization
- A new gradient method via quasi-Cauchy relation which guarantees descent
- Alternating multi-step quasi-Newton methods for unconstrained optimization
- Modified two-point stepsize gradient methods for unconstrained optimization
- New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation
- Optimization theory and methods. Nonlinear programming
- Sizing and Least-Change Secant Methods
- Two-Point Step Size Gradient Methods
- Testing Unconstrained Optimization Software
- Alternate minimization gradient method
- Benchmarking optimization software with performance profiles.
This page was built for publication: An improved multi-step gradient-type method for large scale optimization