An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
From MaRDI portal
The authors propose a modification of the Polak-Ribiére-Polyak method for large-scale nonlinear optimization problems with box constraints. The modification results from an alternative approach which, at each step of the iteration, needs less storage to update both the active and non-active variables. Sufficient conditions are given (including Lipschitz continuity) guaranteeing global convergence. Numerical examples are presented demonstrating the applicability of the algorithm.
Recommendations
- An active set truncated Newton method for large-scale bound constrained optimization
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Modified active set projected spectral gradient method for bound constrained optimization
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- An active set feasible method for large-scale minimization problems with bound constraints
Cites work
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- A New Active Set Algorithm for Box Constrained Optimization
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- A survey of nonlinear conjugate gradient methods
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- Algorithm 813
- Algorithms for bound constrained quadratic programming problems
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Benchmarking optimization software with performance profiles.
- CUTE
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Newton's Method for Large Bound-Constrained Optimization Problems
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Numerical methods for large-scale nonlinear optimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
Cited in
(18)- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- 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
- A two-stage active-set algorithm for bound-constrained optimization
- 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
- scientific article; zbMATH DE number 5670814 (Why is no real title available?)
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- A subspace modified PRP method for large-scale nonlinear box-constrained optimization
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
- Partially symmetrical derivative-free Liu-Storey projection method for convex constrained equations
- Some new three-term Hestenes-Stiefel conjugate gradient methods with affine combination
- Modified active set projected spectral gradient method for bound constrained optimization
- An efficient and robust structural reliability analysis method with mixed variables based on hybrid conjugate gradient direction
- Polyak minorant method for convex optimization
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- An improved PRP conjugate gradient algorithm with a damping factor within an automatic restarting strategy
This page was built for publication: An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935275)
