A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
From MaRDI portal
Publication:6056240
DOI10.1016/j.cam.2023.115563zbMath1522.90207MaRDI QIDQ6056240
Publication date: 30 October 2023
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- A new nonmonotone spectral residual method for nonsmooth nonlinear equations
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering
- Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
- A class on nonmonotone stabilization methods in unconstrained optimization
- On efficiency of nonmonotone Armijo-type line searches
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- Convergence of nonmonotone line search method
- Minimization of functions having Lipschitz continuous first partial derivatives
- An adaptive nonmonotone line search for multiobjective optimization problems
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- A class of nonmonotone Armijo-type line search method for unconstrained optimization
- NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- A New Active Set Algorithm for Box Constrained Optimization
- Two-Point Step Size Gradient Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation
- An Adaptive Nonmonotone Projected Barzilai-Borwein Gradient Method with Active Set Prediction for Nonnegative Matrix Factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- A new nonmonotone line search technique for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
This page was built for publication: A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering