Pages that link to "Item:Q5287664"
From MaRDI portal
The following pages link to On the Barzilai and Borwein choice of steplength for the gradient method (Q5287664):
Displaying 50 items.
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- A Barzilai-Borwein conjugate gradient method (Q341313) (← links)
- A new nonmonotone spectral residual method for nonsmooth nonlinear equations (Q344250) (← links)
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations (Q369446) (← links)
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization (Q370023) (← links)
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- An efficient gradient method using the Yuan steplength (Q480934) (← links)
- A new modified Barzilai-Borwein gradient method for the quadratic minimization problem (Q511967) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- Convex constrained optimization for large-scale generalized Sylvester equations (Q535294) (← links)
- An implicit preconditioning strategy for large-scale generalized Sylvester equations (Q546059) (← links)
- A box constrained gradient projection algorithm for compressed sensing (Q553750) (← links)
- Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← 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)
- Geometric interpretation of some Cauchy related methods (Q647366) (← links)
- Scalar correction method for solving large scale unconstrained minimization problems (Q658551) (← links)
- FR type methods for systems of large-scale nonlinear monotone equations (Q668736) (← links)
- A computation study on an integrated alternating direction method of multipliers for large scale optimization (Q683915) (← links)
- A Kronecker approximation with a convex constrained optimization method for blind image restoration (Q694158) (← links)
- Residual methods for the large-scale matrix \(p\)th root and some related problems (Q711300) (← links)
- A limited memory steepest descent method (Q715093) (← links)
- A framework of constraint preserving update schemes for optimization on Stiefel manifold (Q747775) (← links)
- Some projection methods with the BB step sizes for variational inequalities (Q765311) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- Hybrid spectral gradient method for the unconstrained minimization problem (Q839039) (← links)
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions (Q839683) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- New inexact line search method for unconstrained optimization (Q850832) (← links)
- Gradient methods with adaptive step-sizes (Q853675) (← links)
- Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations (Q882583) (← links)
- An accelerated double step size model in unconstrained optimization (Q902839) (← links)
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm (Q925253) (← links)
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method (Q941611) (← links)
- Multivariate spectral gradient method for unconstrained optimization (Q945298) (← links)
- Acceleration of the EM algorithm via extrapolation methods: review, comparison and new methods (Q962312) (← links)
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration (Q993545) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- A descent algorithm without line search for unconstrained optimization (Q1044422) (← links)
- Sizing the BFGS and DFP updates: Numerical study (Q1321366) (← links)
- Maxentropic analysis of linear programming problems (Q1381754) (← links)
- Linear reconstruction problems with convex constraints: Influence of the a priori data (Q1569190) (← links)
- A comparative study of some reconstruction methods for linear inverse problems. (Q1596981) (← links)
- A residual algorithm for finding a fixed point of a nonexpansive mapping (Q1615317) (← links)
