Two-Point Step Size Gradient Methods
From MaRDI portal
Publication:3779680
DOI10.1093/IMANUM/8.1.141zbMATH Open0638.65055OpenAlexW2076605490WikidataQ56935973 ScholiaQ56935973MaRDI QIDQ3779680FDOQ3779680
Authors: Jonathan Barzilai, Jonathan M. Borwein 
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
Recommendations
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)
Cited In (only showing first 100 items - show all)
- Spatio-temporal random fields: compressible representation and distributed estimation
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- A spectral algorithm for large-scale systems of nonlinear monotone equations
- Greatest descent algorithms in unconstrained optimization
- A review of nonlinear FFT-based computational homogenization methods
- Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization
- On the asymptotic behaviour of some new gradient methods
- A new gradient method with an optimal stepsize property
- Accelerated linearized Bregman method
- A modified spectral conjugate gradient method for solving unconstrained minimization problems
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- Preconditioning non-monotone gradient methods for retrieval of seismic reflection signals
- Semiparametric Regression Analysis of Panel Count Data: A Practical Review
- Low-rank spectral optimization via gauge duality
- Projection onto a polyhedron that exploits sparsity
- Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations
- Composite SAR imaging using sequential joint sparsity
- An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory
- A double-projection-based algorithm for large-scale nonlinear systems of monotone equations
- Asymptotic behaviour of a family of gradient algorithms in \(\mathbb R^{ d }\) and Hilbert spaces
- A convergent least-squares regularized blind deconvolution approach
- An implicit preconditioning strategy for large-scale generalized Sylvester equations
- Adaptive two-point stepsize gradient algorithm
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- Projected Barzilai-Borwein method for large-scale nonnegative image restoration
- Alternate step gradient method*
- Learning from comparisons and choices
- On the steplength selection in gradient methods for unconstrained optimization
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- Differential equations and solution of linear systems
- A parallel orbital-updating based optimization method for electronic structure calculations
- A descent Dai-Liao conjugate gradient method for nonlinear equations
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- 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
- Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Implementation of an optimal first-order method for strongly convex total variation regularization
- On the nonmonotone line search
- 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 affine scaling method for optimization problems with polyhedral constraints
- On the steepest descent algorithm for quadratic functions
- An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost
- Gradient algorithms for quadratic optimization with fast convergence rates
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- 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
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization
- A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations
- A new two-step gradient-type method for large-scale unconstrained optimization
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
- Convex regularization in statistical inverse learning problems
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
- New spectral LS conjugate gradient method for nonlinear unconstrained optimization
- Modified two-point stepsize gradient methods for unconstrained optimization
- Multivariate spectral gradient method for unconstrained optimization
- Estimation of spectral bounds in gradient algorithms
- A globally convergent derivative-free method for solving large-scale nonlinear monotone equations
- A new gradient method via quasi-Cauchy relation which guarantees descent
- Computing the generalized eigenvalues of weakly symmetric tensors
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- Nomonotone spectral gradient method for sparse recovery
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC)
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- An efficient augmented Lagrangian method with applications to total variation minimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A new generalized shrinkage conjugate gradient method for sparse recovery
- Gradient descent and fast artificial time integration
- 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
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Variational Bayesian strategies for high-dimensional, stochastic design problems
- The chaotic nature of faster gradient descent methods
- A PRP type method for systems of monotone equations
- An efficient gradient method using the Yuan steplength
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Spectral scaling BFGS method
- Duality-based algorithms for total-variation-regularized image restoration
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- A limited memory steepest descent method
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- Applying powell's symmetrical technique to conjugate gradient methods
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
This page was built for publication: Two-Point Step Size Gradient Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779680)
