Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
From MaRDI portal
Recommendations
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- Preconditioned conjugate gradient algorithms for nonconvex problems
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Conjugate gradient algorithms in nonconvex optimization
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 4100967 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Limited Memory Algorithm for Bound Constrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A fast and robust unconstrained optimization method requiring minimum storage
- Algorithm 778: L-BFGS-B
- An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables
- Benchmarking optimization software with performance profiles.
- CUTE
- Exposing Constraints
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Global convergence of the method of shortest residuals
- Line search algorithms with guaranteed sufficient decrease
- Newton's Method for Large Bound-Constrained Optimization Problems
- Numerical Optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- On the Goldstein-Levitin-Polyak gradient projection method
- On the Identification of Active Constraints
- On the convergence of conjugate gradient algorithms
- On the limited memory BFGS method for large scale optimization
- Preconditioned conjugate gradient algorithms for nonconvex problems
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Representations of quasi-Newton matrices and their use in limited memory methods
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(4)- Tackling box-constrained optimization via a new projected quasi-Newton approach
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- Preconditioned conjugate gradient algorithms for nonconvex problems
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
This page was built for publication: Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985699)
