An active set truncated Newton method for large-scale bound constrained optimization
From MaRDI portal
Recommendations
- An active set feasible method for large-scale minimization problems with bound constraints
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- An active set quasi-Newton method with projected search for bound constrained minimization
- scientific article; zbMATH DE number 2058392
Cites work
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Limited Memory Algorithm for Bound Constrained Optimization
- A New Active Set Algorithm for Box Constrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- CUTE
- Incomplete Cholesky Factorizations with Limited Memory
- Newton's Method for Large Bound-Constrained Optimization Problems
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Numerical methods for large-scale nonlinear optimization
- On the Identification of Active Constraints
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
Cited in
(12)- scientific article; zbMATH DE number 1078402 (Why is no real title available?)
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An active set quasi-Newton method with projected search for bound constrained minimization
- An active set trust region method for general bound constrained optimization
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- A two-stage active-set algorithm for bound-constrained optimization
- An active set feasible method for large-scale minimization problems with bound constraints
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- A novel projected gradient-like method for optimization problems with simple constraints
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- scientific article; zbMATH DE number 5670814 (Why is no real title available?)
This page was built for publication: An active set truncated Newton method for large-scale bound constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q316586)
