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 novel approach for solving semidefinite programs
- Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem
- Discrete processes and their continuous limits
- On efficiency of nonmonotone Armijo-type line searches
- A computation study on an integrated alternating direction method of multipliers for large scale optimization
- An adaptive scaled BFGS method for unconstrained optimization
- Numerical methods for high-dimensional kinetic equations
- A two-stage active-set algorithm for bound-constrained optimization
- A hybrid ODE-based method for unconstrained optimization problems
- Sparse variational Bayesian approximations for nonlinear inverse problems: applications in nonlinear elastography
- Comparison of minimization methods for nonsmooth image segmentation
- A double parameter scaled BFGS method for unconstrained optimization
- Real-time adaptive optics with pyramid wavefront sensors. II: Accurate wavefront reconstruction using iterative methods
- New iterative schemes for nonlinear fixed point problems, with applications to problems with bifurcations and incomplete-data problems
- A residual method for solving nonlinear operator equations and their application to nonlinear integral equations using symbolic computation
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
- Receding horizon control for the stabilization of the wave equation
- Computation of sum of squares polynomials from data points
- A curvilinear method based on minimal-memory BFGS updates
- Residual methods for the large-scale matrix \(p\)th root and some related problems
- Seismic impedance inversion using \(l_1\)-norm regularization and gradient descent methods
- Steepest descent method with random step lengths
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations
- An accelerated linearized alternating direction method of multipliers
- New adaptive Barzilai-Borwein step size and its application in solving large-scale optimization problems
- An approach based on dwindling filter method for positive definite generalized eigenvalue problem
- Adaptive \(l_1\)-regularization for short-selling control in portfolio selection
- New stepsizes for the gradient method
- A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems
- Two-step version of fixed point continuation method for sparse reconstruction
- A simple sufficient descent method for unconstrained optimization
- A spectral conjugate gradient method for nonlinear inverse problems
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- An efficient optimization approach for a cardinality-constrained index tracking problem
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- Diagonal BFGS updates and applications to the limited memory BFGS method
- Modified active set projected spectral gradient method for bound constrained optimization
- Some projection methods with the BB step sizes for variational inequalities
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- A modified scaled memoryless symmetric rank-one method
- A modified bat algorithm with conjugate gradient method for global optimization
- Impulse noise removal by an adaptive trust-region method
- Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
- ON A CONJECTURE OF G. FORSYTHE
- Cooperative concurrent asynchronous computation of the solution of symmetric linear systems
- Hybrid regularization methods for seismic reflectivity inversion
- A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- Combining line search and trust-region methods forℓ1-minimization
- An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
- A simple and feasible method for a class of large-scale \(l^1\)-problems
- A new gradient method via least change secant update
- Proximal extrapolated gradient methods for variational inequalities
- Gradient-based method with active set strategy for \(\ell _1\) optimization
- On memory gradient method with trust region for unconstrained optimization
- Scalar correction method for solving large scale unconstrained minimization problems
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- A linearly convergent stochastic recursive gradient method for convex optimization
- Convergence of descent method with new line search
- Inertial projected gradient method for large-scale topology optimization
- An adjoint method in inverse problems of chromatography
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- A modified spectral conjugate gradient method with global convergence
- 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
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)
