An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
From MaRDI portal
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 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 limited-memory multipoint symmetric secant method for bound constrained optimization
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- A survey of nonlinear conjugate gradient methods
- 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
(17)- An efficient and robust structural reliability analysis method with mixed variables based on hybrid conjugate gradient direction
- A two-stage active-set algorithm for bound-constrained optimization
- scientific article; zbMATH DE number 5670814 (Why is no real title available?)
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- Some new three-term Hestenes-Stiefel conjugate gradient methods with affine combination
- Partially symmetrical derivative-free Liu-Storey projection method for convex constrained equations
- A subspace modified PRP method for large-scale nonlinear box-constrained optimization
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- Modified active set projected spectral gradient method for bound constrained optimization
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- A modified nonmonotone hestenes-Stiefel type conjugate gradient methods for large-scale unconstrained problems
- Polyak minorant method for convex optimization
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
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)
