Monotone projected gradient methods for large-scale box-constrained quadratic programming

DOI10.1007/s11425-006-0688-2zbMath1112.90056OpenAlexW1491962618MaRDI QIDQ862715

N. E. Zubov

Publication date: 24 January 2007

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-006-0688-2

zbMATH Keywords

large-scale problemsprojected gradientsbox-constrained quadratic programmingmonotone gradient methods

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (6)

New semidefinite programming relaxations for box constrained quadratic program ⋮ 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 ⋮ Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds ⋮ Improving ultimate convergence of an augmented Lagrangian method ⋮ IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS

Uses Software

• LANCELOT
• SPG
• CUTEr
• SifDec
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Analysis of monotone 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
• Two-Point Step Size Gradient Methods
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• Numerical Optimization
• Exposing Constraints
• CUTE
• 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
• Algorithm 813
• CUTEr and SifDec
• Convex programming in Hilbert space

This page was built for publication: Monotone projected gradient methods for large-scale box-constrained quadratic programming