Hybrid spectral gradient method for the unconstrained minimization problem
From MaRDI portal
Publication:839039
DOI10.1007/s10898-008-9318-6zbMath1180.90248OpenAlexW2086698159MaRDI QIDQ839039
William La Cruz, Gilberto Noguera
Publication date: 1 September 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9318-6
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59) Numerical methods based on nonlinear programming (49M37)
Related Items (6)
A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius ⋮ Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem ⋮ Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search ⋮ A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems ⋮ A hybrid BB-type method for solving large scale unconstrained optimization ⋮ A generalized worst-case complexity analysis for non-monotone line searches
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized two-point ellipsoidal anisotropic ray tracing for converted waves
- Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- Modified two-point stepsize gradient methods for unconstrained optimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Minimization subproblems and heuristics for an applied clustering problem
- Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate.
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- On the asymptotic behaviour of some new gradient methods
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
- A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Method of sentinels for packing items within arbitrary convex regions
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Two-Point Step Size Gradient Methods
- Gradient Method with Retards and Generalizations
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Inexact spectral projected gradient methods on convex sets
- Alternate step gradient method*
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- The Molecule Problem: Exploiting Structure in Global Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Automatic differentiation and spectral projected gradient methods for optimal control problems
- On the Barzilai and Borwein choice of steplength for the gradient method
- Gradient projection methods for quadratic programs and applications in training support vector machines
- Algorithm 813
- Computing the Ehrhart quasi-polynomial of a rational simplex
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- A Simplex Method for Function Minimization
- Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
- Adaptive two-point stepsize gradient algorithm
- On the nonmonotone line search
This page was built for publication: Hybrid spectral gradient method for the unconstrained minimization problem
