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.
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems (Q1649149) (← links)
- A new adaptive Barzilai and Borwein method for unconstrained optimization (Q1653281) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- A joint matrix minimization approach for multi-image face recognition (Q1656900) (← links)
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← links)
- Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
- A spectral algorithm for large-scale systems of nonlinear monotone equations (Q1689459) (← links)
- A unified formulation for generalized oilfield development optimization (Q1702333) (← links)
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares (Q1715713) (← links)
- A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems (Q1725601) (← links)
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems (Q1736403) (← links)
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization (Q1751056) (← links)
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems (Q1770091) (← links)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- Minimization subproblems and heuristics for an applied clustering problem (Q1869508) (← links)
- A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems (Q1938001) (← links)
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems (Q1938919) (← links)
- Impulse noise removal by a nonmonotone adaptive gradient method (Q1957285) (← links)
- Stochastic gradient method with Barzilai-Borwein step for unconstrained nonlinear optimization (Q1995392) (← links)
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints (Q1996996) (← links)
- Nonlocal problem for a general second-order elliptic operator (Q2006027) (← links)
- Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications (Q2016276) (← links)
- Analysis of continuous \(H^{-1}\)-least-squares methods for the steady Navier-Stokes system (Q2019998) (← links)
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models (Q2029917) (← links)
- Spectral residual method for nonlinear equations on Riemannian manifolds (Q2052260) (← 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)
- A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations (Q2089889) (← links)
- A class of line search-type methods for nonsmooth convex regularized minimization (Q2098339) (← links)
- On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
- Diagonal BFGS updates and applications to the limited memory BFGS method (Q2114834) (← links)
- An extended projected residual algorithm for solving smooth convex optimization problems (Q2141614) (← links)
- A Newton Frank-Wolfe method for constrained self-concordant minimization (Q2141726) (← links)
- Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces (Q2188946) (← links)
- Two-point step size gradient method for solving a deep learning problem (Q2190628) (← 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)
- A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
- A new projected Barzilai-Borwein method for the symmetric cone complementarity problem (Q2227325) (← links)
- Improved SVRG for finite sum structure optimization with application to binary classification (Q2244210) (← links)
- A new spectral method for \(l_1\)-regularized minimization (Q2254769) (← links)
- Exact spectral-like gradient method for distributed optimization (Q2282815) (← links)
- A delayed weighted gradient method for strictly convex quadratic minimization (Q2282816) (← links)
- Accelerated augmented Lagrangian method for total variation minimization (Q2322436) (← links)
- A family of spectral gradient methods for optimization (Q2322552) (← links)
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
- A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
- Convergence analysis for the modified spectral projected subgradient method (Q2355316) (← links)
