Two-Point Step Size Gradient Methods
From MaRDI portal
Publication:3779680
DOI10.1093/IMANUM/8.1.141zbMath0638.65055OpenAlexW2076605490WikidataQ56935973 ScholiaQ56935973MaRDI QIDQ3779680
Jonathan M. Borwein, Jonathan Barzilai
Publication date: 1988
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/8.1.141
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (only showing first 100 items - show all)
On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems ⋮ On the application of the spectral projected gradient method in image segmentation ⋮ Algorithms that satisfy a stopping criterion, probably ⋮ On Hager and Zhang's conjugate gradient method with guaranteed descent ⋮ An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions ⋮ A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem ⋮ On some steplength approaches for proximal algorithms ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Projection algorithms for nonconvex minimization with application to sparse principal component analysis ⋮ On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients ⋮ A gradient-based method for atmospheric tomography ⋮ Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems ⋮ A Barzilai-Borwein conjugate gradient method ⋮ Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem ⋮ A new nonmonotone spectral residual method for nonsmooth nonlinear equations ⋮ On the worst case performance of the steepest descent algorithm for quadratic functions ⋮ Expectation propagation for nonlinear inverse problems -- with an application to electrical impedance tomography ⋮ Dynamic multi-source X-ray tomography using a spacetime level set method ⋮ Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional ⋮ Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization ⋮ An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost ⋮ Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method ⋮ Inverse determination of a heat source from natural convection in a porous cavity ⋮ Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization ⋮ Scaling on the spectral gradient method ⋮ Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations ⋮ Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization ⋮ ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals ⋮ A new two-step gradient-type method for large-scale unconstrained optimization ⋮ Spectral scaling BFGS method ⋮ Estimation of spectral bounds in gradient algorithms ⋮ Two-step version of fixed point continuation method for sparse reconstruction ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ A simple sufficient descent method for unconstrained optimization ⋮ Duality-based algorithms for total-variation-regularized image restoration ⋮ Spatio-temporal random fields: compressible representation and distributed estimation ⋮ Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds ⋮ Operator splittings, Bregman methods and frame shrinkage in image processing ⋮ Gradient algorithms for quadratic optimization with fast convergence rates ⋮ Preconditioning non-monotone gradient methods for retrieval of seismic reflection signals ⋮ A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ Implementation of an optimal first-order method for strongly convex total variation regularization ⋮ Modified active set projected spectral gradient method for bound constrained optimization ⋮ An improved multi-step gradient-type method for large scale optimization ⋮ Global convergence of a spectral conjugate gradient method for unconstrained optimization ⋮ Hybrid regularization methods for seismic reflectivity inversion ⋮ Two effective hybrid conjugate gradient algorithms based on modified BFGS updates ⋮ A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei ⋮ Geometric interpretation of some Cauchy related methods ⋮ The chaotic nature of faster gradient descent methods ⋮ A new analysis on the Barzilai-Borwein gradient method ⋮ Folding-free global conformal mapping for genus-0 surfaces by harmonic energy minimization ⋮ Iterative hard thresholding methods for \(l_0\) regularized convex cone programming ⋮ Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming ⋮ Linear convergence of a type of iterative sequences in nonconvex quadratic programming ⋮ Scalar correction method for solving large scale unconstrained minimization problems ⋮ Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing ⋮ An efficient gradient method using the Yuan steplength ⋮ Adaptive choice of the Tikhonov regularization parameter to solve ill-posed linear algebraic equations via Liapunov optimizing control ⋮ A Barzilai-Borwein type method for stochastic linear complementarity problems ⋮ A new generalized shrinkage conjugate gradient method for sparse recovery ⋮ A feasible filter method for the nearest low-rank correlation matrix problem ⋮ A Barzilai-Borwein type method for minimizing composite functions ⋮ A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations ⋮ Norm descent conjugate gradient methods for solving symmetric nonlinear equations ⋮ Spectral gradient method for impulse noise removal ⋮ A nonmonotone line search method for noisy minimization ⋮ A class of diagonal quasi-Newton methods for large-scale convex minimization ⋮ Obituary: Jonathan M. Borwein (1951--2016). Homo sapiens, homo ludens ⋮ A new modified Barzilai-Borwein gradient method for the quadratic minimization problem ⋮ Computing the generalized eigenvalues of weakly symmetric tensors ⋮ A computation study on an integrated alternating direction method of multipliers for large scale optimization ⋮ An adaptive scaled BFGS method for unconstrained optimization ⋮ A limited memory descent Perry conjugate gradient method ⋮ The matrix pencil nearness problem in structural dynamic model updating ⋮ A Kronecker approximation with a convex constrained optimization method for blind image restoration ⋮ A hybrid ODE-based method for unconstrained optimization problems ⋮ Modified nonmonotone Armijo line search for descent method ⋮ Convex constrained optimization for large-scale generalized Sylvester equations ⋮ A practical method for solving large-scale TRS ⋮ Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing ⋮ Applying powell's symmetrical technique to conjugate gradient methods ⋮ Feasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problem ⋮ An implicit preconditioning strategy for large-scale generalized Sylvester equations ⋮ Large correlation analysis ⋮ A box constrained gradient projection algorithm for compressed sensing ⋮ A feasible method for optimization with orthogonality constraints ⋮ A residual method for solving nonlinear operator equations and their application to nonlinear integral equations using symbolic computation ⋮ Convergence properties of nonmonotone spectral projected gradient methods ⋮ Residual methods for the large-scale matrix \(p\)th root and some related problems ⋮ A curvilinear method based on minimal-memory BFGS updates ⋮ An augmented Lagrangian approach for sparse principal component analysis ⋮ A limited memory steepest descent method ⋮ An approach based on dwindling filter method for positive definite generalized eigenvalue problem ⋮ Variational Bayesian strategies for high-dimensional, stochastic design problems ⋮ An affine scaling method for optimization problems with polyhedral constraints ⋮ A framework of constraint preserving update schemes for optimization on Stiefel manifold ⋮ Some projection methods with the BB step sizes for variational inequalities ⋮ Nomonotone spectral gradient method for sparse recovery
This page was built for publication: Two-Point Step Size Gradient Methods
