An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
From MaRDI portal
Publication:1935275
DOI10.1007/s10957-012-0091-9zbMath1276.90067OpenAlexW1969687432MaRDI QIDQ1935275
Publication date: 14 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0091-9
Related Items
Partially symmetrical derivative-free Liu–Storey projection method for convex constrained equations ⋮ A two-stage active-set algorithm for bound-constrained optimization ⋮ Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination ⋮ An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition ⋮ A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction ⋮ Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence ⋮ An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
Uses Software
Cites Work
- Unnamed Item
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Algorithms for bound constrained quadratic programming problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- 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
- 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
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- Algorithm 813
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Benchmarking optimization software with performance profiles.
