Pages that link to "Item:Q480934"

The following pages link to An efficient gradient method using the Yuan steplength (Q480934):

Displaying 44 items.

• On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems (Q268305) (← links)
• On the application of the spectral projected gradient method in image segmentation (Q268708) (← links)
• On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
• On the worst case performance of the steepest descent algorithm for quadratic functions (Q344945) (← links)
• A generalized eigenvalues classifier with embedded feature selection (Q526414) (← links)
• A new steplength selection for scaled gradient methods with application to image deblurring (Q897119) (← links)
• Regularized quadratic penalty methods for shape from shading (Q1674231) (← links)
• A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
• Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm (Q1790679) (← links)
• A coordinate descent method for total variation minimization (Q1992568) (← links)
• Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
• A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems (Q2025210) (← links)
• Properties of the delayed weighted gradient method (Q2026769) (← links)
• On the asymptotic convergence and acceleration of gradient methods (Q2053340) (← 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)
• On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
• An accelerated minimal gradient method with momentum for strictly convex quadratic optimization (Q2132432) (← links)
• On initial point selection of the steepest descent algorithm for general quadratic functions (Q2141353) (← links)
• Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces (Q2188946) (← links)
• Fast gradient methods with alignment for symmetric linear systems without using Cauchy step (Q2195925) (← links)
• A family of modified spectral projection methods for nonlinear monotone equations with convex constraint (Q2214774) (← links)
• Variable metric techniques for forward-backward methods in imaging (Q2222135) (← links)
• New stepsizes for the gradient method (Q2228379) (← links)
• A second-order gradient method for convex minimization (Q2236579) (← links)
• Fused Lasso approach in portfolio selection (Q2241053) (← links)
• A delayed weighted gradient method for strictly convex quadratic minimization (Q2282816) (← links)
• ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration (Q2284080) (← links)
• A family of spectral gradient methods for optimization (Q2322552) (← links)
• Semi-supervised generalized eigenvalues classification (Q2329903) (← links)
• Adaptive \(l_1\)-regularization for short-selling control in portfolio selection (Q2419515) (← links)
• Gradient method with multiple damping for large-scale unconstrained optimization (Q2421450) (← links)
• On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
• Split Bregman iteration for multi-period mean variance portfolio optimization (Q2662553) (← links)
• A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization (Q2672727) (← links)
• A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
• Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property (Q5013590) (← links)
• Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems (Q5094911) (← links)
• Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds (Q5110558) (← links)
• Gradient methods exploiting spectral properties (Q5135250) (← links)
• Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method (Q5858990) (← links)
• On the steepest descent algorithm for quadratic functions (Q5963682) (← links)
• A gradient method exploiting the two dimensional quadratic termination property (Q6110631) (← links)
• On the Preconditioned Delayed Weighted Gradient Method (Q6177046) (← links)