Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
From MaRDI portal
Publication:1722397
DOI10.1155/2014/236158zbMATH Open1470.90157OpenAlexW1972204852WikidataQ59036552 ScholiaQ59036552MaRDI QIDQ1722397FDOQ1722397
Authors: Qiuyu Wang, Yingtao Che 
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
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
- Algorithm 778: L-BFGS-B
- CUTE
- A Limited Memory Algorithm for Bound Constrained Optimization
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A New Active Set Algorithm for Box Constrained Optimization
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- A survey of nonlinear conjugate gradient methods
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Title not available (Why is that?)
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Numerical methods for large-scale nonlinear optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- Modified active set projected spectral gradient method for bound constrained optimization
Cited In (2)
Uses Software
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)
