Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
type: Item
instance of: scholarly article
title: Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
zbMATH Open document ID: 1154.65051
author: Zhensheng Yu
published in: Applied Numerical Mathematics
publication date: 2008-09-01T00:00:00Z
review text: A new nonmonotone spectral projected gradient method for the following bound constrained optimization problem is proposed: \[ \min_{x\in\mathbb{R}^n}\,f(x)\qquad\text{s.t. }1\leq x\leq u. \] The novelty of the given method is that the global convergence can be obtained under mild conditions without requiring a prior the existence of a limit point. Numerical tests are presented.
reviewed by: Hans Benker
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5318786
zbMATH Keywords: bound constrained optimization
zbMATH Keywords: nonmonotone spectral projected gradient method
zbMATH Keywords: global convergence
zbMATH Keywords: numerical examples
MaRDI profile type: Publication
full work available at URL: j.apnum.2007.07.007
OpenAlex ID: W1984687314
cites work: Spectral projected gradient and variable metric methods for optimization with linear inequalities
cites work: Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
cites work: Q3023721
cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Inexact spectral projected gradient methods on convex sets
cites work: A nonmonotone trust region method for nonlinear programming with simple bound constraints
cites work: Trust Region Methods
cites work: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
cites work: Adaptive two-point stepsize gradient algorithm
cites work: Q5702604
cites work: A new trust region algorithm for bound constrained minimization
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints
cites work: On the Barzilai and Borwein choice of steplength for the gradient method
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems
cites work: Convergence properties of nonmonotone spectral projected gradient methods
DOI: 10.1016/J.APNUM.2007.07.007
description: scientific article; zbMATH DE number 5318786