Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
type: Item
instance of: scholarly article
title: Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
zbMATH Open document ID: 1173.90584
published in: Applied Mathematics and Optimization
publication date: 2009-06-08T00:00:00Z
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5562562
zbMATH Keywords: bound constrained problem
zbMATH Keywords: Barzilai-Borwein gradient method
zbMATH Keywords: nonmonotone line search
zbMATH Keywords: stationary point
author: Yunhai Xiao
author: Qingjie Hu
describes a project that uses: BOX-QUACAN
describes a project that uses: SPG
describes a project that uses: LBFGS-B
describes a project that uses: CUTEr
MaRDI profile type: Publication
full work available at URL: s00245-008-9038-9
OpenAlex ID: W1984229420
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
cites work: Two-Point Step Size Gradient Methods
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Algorithm 813
cites work: Inexact spectral projected gradient methods on convex sets
cites work: A limited-memory multipoint symmetric secant method for bound constrained optimization
cites work: A Limited Memory Algorithm for Bound Constrained Optimization
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
cites work: CUTE
cites work: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
cites work: On the asymptotic behaviour of some new gradient methods
cites work: \(R\)-linear convergence of the Barzilai and Borwein gradient method
cites work: Modified two-point stepsize gradient methods for unconstrained optimization
cites work: The cyclic Barzilai-–Borwein method for unconstrained optimization
cites work: Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
cites work: Benchmarking optimization software with performance profiles.
cites work: An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
cites work: A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
cites work: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
cites work: Numerical methods for large-scale nonlinear optimization
cites work: A New Active Set Algorithm for Box Constrained Optimization
cites work: Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
cites work: Control of linear dynamic market systems
cites work: BOX-QUACAN and the implementation of augmented Lagrangian algorithms for minimization with inequality constraints
cites work: A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
cites work: On the Barzilai and Borwein choice of steplength for the gradient method
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
DOI: 10.1007/S00245-008-9038-9
description: scientific article; zbMATH DE number 5562562