Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization

DOI10.1155/2014/236158zbMath1470.90157OpenAlexW1972204852WikidataQ59036552 ScholiaQ59036552MaRDI QIDQ1722397

Yingtao Che, Qiuyu Wang

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/236158

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of reduced gradient type (90C52)

Uses Software

• L-BFGS-B
• L-BFGS
• CUTEr
• LBFGS-B
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Modified active set projected spectral gradient method for bound constrained optimization
• Active-set projected trust-region algorithm for box-constrained nonsmooth equations
• An active set limited memory BFGS algorithm for large-scale bound constrained optimization
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Numerical methods for large-scale nonlinear optimization
• A New Active Set Algorithm for Box Constrained Optimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Algorithm 778: L-BFGS-B
• 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
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• 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

This page was built for publication: Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization