Pages that link to "Item:Q1021258"
From MaRDI portal
The following pages link to Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258):
Displaying 14 items.
- An active set truncated Newton method for large-scale bound constrained optimization (Q316586) (← links)
- Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization (Q354621) (← links)
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
- A feasible decomposition method for constrained equations and its application to complementarity problems (Q475708) (← links)
- A multivariate spectral projected gradient method for bound constrained optimization (Q629482) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems (Q1664763) (← links)
- Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems (Q1665639) (← links)
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization (Q1722397) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization (Q2846484) (← links)
- Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing (Q5023935) (← links)
