Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
From MaRDI portal
Publication:1021258
DOI10.1007/s00245-008-9038-9zbMath1173.90584OpenAlexW1984229420MaRDI QIDQ1021258
Publication date: 8 June 2009
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-008-9038-9
Related Items
An active set truncated Newton method for large-scale bound constrained optimization ⋮ Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization ⋮ Multivariate spectral gradient algorithm for nonsmooth convex optimization problems ⋮ Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems ⋮ An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization ⋮ A multivariate spectral projected gradient method for bound constrained optimization ⋮ A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization ⋮ Modified active set projected spectral gradient method for bound constrained optimization ⋮ An accurate active set conjugate gradient algorithm with project search for bound constrained optimization ⋮ Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization ⋮ A feasible decomposition method for constrained equations and its application to complementarity problems ⋮ Notes on the Dai-Yuan-Yuan modified spectral gradient method ⋮ AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION ⋮ Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
Uses Software
Cites Work
- Control of linear dynamic market systems
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- Modified two-point stepsize gradient methods for unconstrained optimization
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- BOX-QUACAN and the implementation of augmented Lagrangian algorithms for minimization with inequality constraints
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- On the asymptotic behaviour of some new gradient methods
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Numerical methods for large-scale nonlinear optimization
- A New Active Set Algorithm for Box Constrained Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Two-Point Step Size Gradient Methods
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- CUTE
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Benchmarking optimization software with performance profiles.
