Pages that link to "Item:Q5480392"
From MaRDI portal
The following pages link to The cyclic Barzilai-–Borwein method for unconstrained optimization (Q5480392):
Displayed 50 items.
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems (Q268305) (← links)
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization (Q370023) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- The chaotic nature of faster gradient descent methods (Q454335) (← 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 box constrained gradient projection algorithm for compressed sensing (Q553750) (← links)
- Duality-based algorithms for total-variation-regularized image restoration (Q616786) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- An affine scaling method for optimization problems with polyhedral constraints (Q742300) (← links)
- A framework of constraint preserving update schemes for optimization on Stiefel manifold (Q747775) (← links)
- A scalable computational platform for particulate Stokes suspensions (Q781989) (← links)
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules (Q837553) (← links)
- Hybrid spectral gradient method for the unconstrained minimization problem (Q839039) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
- An affine-scaling interior-point CBB method for box-constrained optimization (Q1013965) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- A new adaptive Barzilai and Borwein method for unconstrained optimization (Q1653281) (← links)
- Shrinking gradient descent algorithms for total variation regularized image denoising (Q1694398) (← links)
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization (Q1715914) (← links)
- Prediction-correction method with BB step sizes (Q1731902) (← links)
- A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization (Q1751056) (← links)
- Nonmonotone spectral method for large-scale symmetric nonlinear equations (Q1938081) (← links)
- A cyclic projected gradient method (Q1946620) (← links)
- Linear convergence analysis of the use of gradient projection methods on total variation problems (Q1946623) (← links)
- Impulse noise removal by a nonmonotone adaptive gradient method (Q1957285) (← links)
- Iterative regularization algorithms for constrained image deblurring on graphics processors (Q1959245) (← links)
- Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
- A convexity enforcing \(C^0\) interior penalty method for the Monge-Ampère equation on convex polygonal domains (Q2049911) (← links)
- Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications (Q2059821) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- On \(R\)-linear convergence analysis for a class of gradient methods (Q2070335) (← links)
- Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
- Diagonal BFGS updates and applications to the limited memory BFGS method (Q2114834) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- Subsampled nonmonotone spectral gradient methods (Q2178981) (← links)
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step (Q2195925) (← links)
- Variable metric techniques for forward-backward methods in imaging (Q2222135) (← links)
- A Riemannian nonmonotone spectral method for self-adjoint tangent vector field (Q2227739) (← links)
- On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
- A family of spectral gradient methods for optimization (Q2322552) (← links)
- A wedge trust region method with self-correcting geometry for derivative-free optimization (Q2353471) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (Q2448155) (← links)
- A globally optimal tri-vector method to solve an ill-posed linear system (Q2511179) (← links)