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

DOI10.1155/2014/236158MaRDI QIDQ1722397zbMATH OpenOpenAlexWikidataFDO

Authors Qiuyu Wang, Yingtao Che

Publication date 14 February 2019

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

Copyright license Creative Commons Attribution 3.0 Unported

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)

Recommendations

• Large-scale active-set box-constrained optimization method with spectral projected gradients
• An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
• An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
• A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
• An accurate active set conjugate gradient algorithm with project search for bound constrained optimization

Cites work

• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A Limited Memory Algorithm for Bound Constrained Optimization
• A New Active Set Algorithm for Box Constrained Optimization
• A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
• A survey of nonlinear conjugate gradient methods
• Active-set projected trust-region algorithm for box-constrained nonsmooth equations
• Algorithm 778: L-BFGS-B
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• An active set limited memory BFGS algorithm for large-scale bound constrained optimization
• CUTE
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• Modified active set projected spectral gradient method for bound constrained optimization
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• Numerical methods for large-scale nonlinear optimization
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization

Cited in

(2)

• A subspace modified PRP method for large-scale nonlinear box-constrained optimization
• An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722397)