A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2058392
- A Trust Regional Algorithm for Bound Constrained Minimization
- scientific article; zbMATH DE number 1078402
- A truncated Newton method for the solution of large-scale inequality constrained minimization problems
- A new trust region algorithm for bound constrained minimization
Cited in
(42)- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- A truncated Newton method for the solution of large-scale inequality constrained minimization problems
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- Tackling box-constrained optimization via a new projected quasi-Newton approach
- A two-stage active-set algorithm for bound-constrained optimization
- A decomposition method for large-scale box constrained optimization
- TeLEx: learning signal temporal logic from positive examples using tightness metric
- An active set algorithm for nonlinear optimization with polyhedral constraints
- An active set strategy based on the multiplier function or the gradient.
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- scientific article; zbMATH DE number 1568984 (Why is no real title available?)
- An active set limited memory BFGS algorithm for bound constrained optimization
- An active set quasi-Newton method with projected search for bound constrained minimization
- An active-set projected trust region algorithm for box constrained optimization problems
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
- An active set feasible method for large-scale minimization problems with bound constraints
- scientific article; zbMATH DE number 1399483 (Why is no real title available?)
- An active set truncated Newton method for large-scale bound constrained optimization
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
- Remark on Algorithm 702—the updated truncated Newton minimization package
- A convergent decomposition method for box-constrained optimization problems
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Global optimization by multilevel coordinate search
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
- A trust region method based on a new affine scaling technique for simple bounded optimization
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- A novel projected gradient-like method for optimization problems with simple constraints
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- An infeasible active-set QP-free algorithm for general nonlinear programming
- scientific article; zbMATH DE number 2058392 (Why is no real title available?)
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- Numerical experience with the truncated Newton method for unconstrained optimization
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
This page was built for publication: A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785864)
