In this paper, we give some notes on the two modified spectral gradient methods which were
developed in [10]. These notes present the relationship between their stepsize formulae and …

In this paper, we propose a modified BFGS (Broyden–Fletcher–Goldfarb–Shanno) method
with nonmonotone line search for unconstrained optimization. Under some mild conditions …

In this paper, we propose an active set modified Polak–Ribiére–Polyak method for solving
large-scale optimization with simple bounds on the variables. The active set is guessed by …

In this paper, we first develop an active set identification technique, and then we suggest a
modified nonmonotone line search rule, in which a new parameter formula is introduced to …

Non-negative matrix factorization (NMF) is a problem to obtain a representation of data
using non-negativity constraints. Since the NMF was first proposed by Lee, NMF has …

We present a new spectral conjugate gradient method based on the Dai-Yuan strategy to
solve large-scale unconstrained optimization problems with applications to compressive …

In this paper, by means of an active set strategy, we present a projected spectral gradient
algorithm for solving large-scale bound constrained optimization problems. A nice property …

In this paper, we consider a multivariate spectral projected gradient (MSPG) method for
bound constrained optimization. Combined with a quasi-Newton property, the multivariate …

In this paper, an active set recognition technique is suggested, and then a modified
nonmonotonic line search rule is presented to enhance the efficiency of the nonmonotonic …

In this paper, we first present an adaptive nonmonotone term to improve the efficiency of
nonmonotone line search, and then an active set identification technique is suggested to get …