Pages that link to "Item:Q3779680"

The following pages link to Two-Point Step Size Gradient Methods (Q3779680):

Displaying 50 items.

• A feasible method for optimization with orthogonality constraints (Q101635) (← links)
• 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)
• On the application of the spectral projected gradient method in image segmentation (Q268708) (← links)
• Algorithms that satisfy a stopping criterion, probably (Q269806) (← links)
• On Hager and Zhang's conjugate gradient method with guaranteed descent (Q273329) (← links)
• An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
• A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem (Q292553) (← links)
• On some steplength approaches for proximal algorithms (Q298853) (← links)
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
• On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
• A gradient-based method for atmospheric tomography (Q326417) (← links)
• Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems (Q329315) (← links)
• A Barzilai-Borwein conjugate gradient method (Q341313) (← links)
• Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664) (← links)
• A new nonmonotone spectral residual method for nonsmooth nonlinear equations (Q344250) (← links)
• On the worst case performance of the steepest descent algorithm for quadratic functions (Q344945) (← links)
• Expectation propagation for nonlinear inverse problems -- with an application to electrical impedance tomography (Q348728) (← links)
• Dynamic multi-source X-ray tomography using a spacetime level set method (Q349831) (← links)
• Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional (Q350070) (← links)
• Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization (Q354621) (← links)
• An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost (Q360475) (← links)
• Inverse determination of a heat source from natural convection in a porous cavity (Q365586) (← links)
• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (Q368088) (← links)
• Scaling on the spectral gradient method (Q368739) (← 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)
• ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
• Estimation of spectral bounds in gradient algorithms (Q385581) (← links)
• Two modified scaled nonlinear conjugate gradient methods (Q390466) (← links)
• Spatio-temporal random fields: compressible representation and distributed estimation (Q399911) (← links)
• Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds (Q408215) (← links)
• Operator splittings, Bregman methods and frame shrinkage in image processing (Q408893) (← links)
• Gradient algorithms for quadratic optimization with fast convergence rates (Q409265) (← links)
• Preconditioning non-monotone gradient methods for retrieval of seismic reflection signals (Q421375) (← 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)
• Implementation of an optimal first-order method for strongly convex total variation regularization (Q438730) (← links)
• Global convergence of a spectral conjugate gradient method for unconstrained optimization (Q448802) (← links)
• A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei (Q453599) (← links)
• The chaotic nature of faster gradient descent methods (Q454335) (← links)
• A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
• Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization (Q461251) (← links)
• Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← 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)
• Adaptive choice of the Tikhonov regularization parameter to solve ill-posed linear algebraic equations via Liapunov optimizing control (Q482677) (← links)