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)
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- Riemannian Optimization on the Symplectic Stiefel Manifold
- A variational approach to Gibbs artifacts removal in MRI
- Nonlinear orthomin\((k)\) methods
- Acceleration of the EM algorithm via extrapolation methods: review, comparison and new methods
- Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
- A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- A maxentropic procedure for reconstructing a distribution from its marginals
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- Biorthogonal vector sequence transformations and Padé approximation of vector series
- Hybrid spectral gradient method for the unconstrained minimization problem
- A residual algorithm for finding a fixed point of a nonexpansive mapping
- A projected derivative-free algorithm for nonlinear equations with convex constraints
- A trust region spectral method for large-scale systems of nonlinear equations
- A new spectral method for \(l_1\)-regularized minimization
- A cyclic block coordinate descent method with generalized gradient projections
- Flow search approach and new bounds for the \(m\)-step linear conjugate gradient algorithm
- Title not available (Why is that?)
- A study on distributed optimization over large-scale networked systems
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Efficient numerical methods for computing the stationary states of phase field crystal models
- Scaled projected-directions methods with application to transmission tomography
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- Stochastic variance reduced gradient methods using a trust-region-like scheme
- On matrix exponentials and their approximations related to optimization on the Stiefel manifold
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- A regularized interior-point method for constrained linear least squares
- Smoothed quantile regression with large-scale inference
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- A residual approach for balanced truncation model reduction (BTMR) of compartmental systems
- A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction
- Simulation of the oxygen distribution in a tumor tissue using residual algorithms
- Gradient methods for computing the Drazin-inverse solution
- Numerical methods for parameter estimation in Poisson data inversion
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization
- On the acceleration of the Barzilai-Borwein method
- A new steplength selection for scaled gradient methods with application to image deblurring
- Nonlinear conjugate gradient method for spectral tomosynthesis
- A modified two-point stepsize gradient algorithm for unconstrained minimization
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- A descent algorithm without line search for unconstrained optimization
- An accelerated double step size model in unconstrained optimization
- A sufficient descent conjugate gradient method and its global convergence
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- Computational experience with numerical methods for nonnegative least-squares problems.
- LMBOPT: a limited memory method for bound-constrained optimization
- Positively constrained total variation penalized image restoration
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- Modified matrix-free methods for solving system of nonlinear equations
- Effective zero-norm minimization algorithms for noisy compressed sensing
- Linear reconstruction problems with convex constraints: Influence of the a priori data
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
- Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph
- On the complexity of solving feasibility problems with regularized models
- Derivative-free optimization methods
- Some remarks on conjugate gradient methods without line search
- Regularization and numerical solution of the inverse scattering problem using shearlet frames
- A gradient descent method for solving a system of nonlinear equations
- 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
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)
