Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming

DOI10.1007/S00211-004-0569-YzbMath1068.65073OpenAlexW2118075667MaRDI QIDQ1770257

Roger Fletcher, Yu-Hong Dai

Publication date: 14 April 2005

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-004-0569-y

zbMATH Keywords

global convergencenumerical experimentsnonmonotone line searchprojected gradient methodlarge-scale box-constrained quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Related Items (only showing first 100 items - show all)

Linearly Constrained Non-Lipschitz Optimization for Image Restoration ⋮ A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ Data-driven distributionally robust risk parity portfolio optimization ⋮ On the rate of convergence of projected Barzilai–Borwein methods ⋮ Bregman iterative algorithms for 2D geosounding inversion ⋮ A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing ⋮ On the convergence rate of scaled gradient projection method ⋮ Projected gradient algorithms for optimization over order simplices ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy ⋮ A gradient method exploiting the two dimensional quadratic termination property ⋮ A barrier method for contact avoiding particles in Stokes flow ⋮ Combined Newton-gradient method for constrained root-finding in chemical reaction networks ⋮ A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems ⋮ A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints ⋮ Gradient-based method with active set strategy for $\ell _1$ optimization ⋮ A non-monotone linear search algorithm with mixed direction on Stiefel manifold ⋮ Gradient methods exploiting spectral properties ⋮ Improving ultimate convergence of an augmented Lagrangian method ⋮ A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION ⋮ IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS ⋮ Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems ⋮ Gradient descent and fast artificial time integration ⋮ A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables ⋮ A structured L-BFGS method and its application to inverse problems ⋮ A hybrid splitting method for smoothing Tikhonov regularization problem ⋮ A random active set method for strictly convex quadratic problem with simple bounds ⋮ The Potts model with different piecewise constant representations and fast algorithms: a survey ⋮ Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems ⋮ An active set method for bound-constrained optimization ⋮ Several kinds of acceleration techniques for unconstrained optimization first-order algorithms ⋮ Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints ⋮ Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ On projected alternating BB methods for variational inequalities ⋮ Riemannian Optimization on the Symplectic Stiefel Manifold ⋮ AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION ⋮ NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS ⋮ Approximate first-order primal-dual algorithms for saddle point problems ⋮ Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property ⋮ An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory ⋮ Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization ⋮ A non-monotonic method for large-scale non-negative least squares ⋮ Scaling techniques for gradient projection-type methods in astronomical image deblurring ⋮ A Spectral Gradient Projection Method for the Positive Semi-definite Procrustes Problem ⋮ 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 ⋮ A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization ⋮ Optimal \(L_2\)-norm empirical importance weights for the change of probability measure ⋮ The active-set method for nonnegative regularization of linear ill-posed problems ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ Hybrid spectral gradient method for the unconstrained minimization problem ⋮ Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ An active set truncated Newton method for large-scale bound constrained optimization ⋮ LMBOPT: a limited memory method for bound-constrained optimization ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems ⋮ Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming ⋮ Monotone projected gradient methods for large-scale box-constrained quadratic programming ⋮ Steepest descent method with random step lengths ⋮ Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization ⋮ Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis ⋮ Multiple graphs clustering by gradient flow method ⋮ Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems ⋮ Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization ⋮ A new two-step gradient-type method for large-scale unconstrained optimization ⋮ Regularized quadratic penalty methods for shape from shading ⋮ Duality-based algorithms for total-variation-regularized image restoration ⋮ An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization ⋮ Shrinking gradient descent algorithms for total variation regularized image denoising ⋮ Maximum-likelihood detection based on branch and bound algorithm for MIMO systems ⋮ A multivariate spectral projected gradient method for bound constrained optimization ⋮ NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods ⋮ Fast projections onto mixed-norm balls with applications ⋮ A new method of moving asymptotes for large-scale linearly equality-constrained minimization ⋮ A cyclic projected gradient method ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ An effective region force for some variational models for learning and clustering ⋮ Solving inverse source problems by the orthogonal solution and kernel correction algorithm (OSKCA) with applications in fluorescence tomography ⋮ Impulse noise removal by a nonmonotone adaptive gradient method ⋮ The chaotic nature of faster gradient descent methods ⋮ Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization ⋮ An accurate active set conjugate gradient algorithm with project search for bound constrained optimization ⋮ A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints ⋮ An active set limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Efficient algorithms for solving condition number-constrained matrix minimization problems ⋮ A new projected Barzilai-Borwein method for the symmetric cone complementarity problem ⋮ An efficient gradient method using the Yuan steplength ⋮ Prediction-correction method with BB step sizes ⋮ On the quadratic eigenvalue complementarity problem over a general convex cone ⋮ A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints ⋮ Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems ⋮ Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations ⋮ Solving bound constrained optimization via a new nonmonotone spectral projected gradient method ⋮ A Barzilai-Borwein type method for minimizing composite functions ⋮ Solving the discrete Euler-Arnold equations for the generalized rigid body motion ⋮ An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices ⋮ An improved gradient projection-based decomposition technique for support vector machines

Uses Software

• CONV_QP
• GPDT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
• Algorithms for bound constrained quadratic programming problems
• Implementing proximal point methods for linear programming
• A class of methods for solving large, convex quadratic programs subject to box constraints
• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
• Modified two-point stepsize gradient methods for unconstrained optimization
• Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
• 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
• On the Identification Property of a Projected Gradient Method
• Projected gradient methods for linearly constrained problems
• Two-Point Step Size Gradient Methods
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• On the Goldstein-Levitin-Polyak gradient projection method
• Gradient Method with Retards and Generalizations
• On the Maximization of a Concave Quadratic Function with Box Constraints
• Inexact spectral projected gradient methods on convex sets
• Alternate step gradient method*
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Line Search Technique for Newton’s Method
• On the Barzilai and Borwein choice of steplength for the gradient method
• Convex programming in Hilbert space
• The conjugate gradient method in extremal problems
• Adaptive two-point stepsize gradient algorithm

This page was built for publication: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming