A nonmonotone trust region method for nonlinear programming with simple bound constraints
From MaRDI portal
Publication:5929888
DOI10.1007/s002450010020zbMath0973.65049OpenAlexW2011207292MaRDI QIDQ5929888
No author found.
Publication date: 17 April 2001
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002450010020
convergenceglobal convergencenumerical experimentsbound constraintsnonmonotone trust region algorithmunconstrained minimization
Related Items (13)
A stochastic approach to global optimization of nonlinear programming problem with many equality constraints ⋮ Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds ⋮ A nonmonotone adaptive trust region method for unconstrained optimization based on conic model ⋮ Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems ⋮ A multivariate spectral projected gradient method for bound constrained optimization ⋮ Global convergence of a nonmonotone trust region algorithm with memory for unconstrained optimization ⋮ Penalty-free method for nonsmooth constrained optimization via radial basis functions ⋮ A nonmonotone trust-region method of conic model for unconstrained optimization ⋮ Solving bound constrained optimization via a new nonmonotone spectral projected gradient method ⋮ A new hybrid method for nonlinear complementarity problems ⋮ A nonmonotone conic trust region method based on line search for solving unconstrained optimization ⋮ Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization ⋮ A nonmonotone trust region method for unconstrained optimization
This page was built for publication: A nonmonotone trust region method for nonlinear programming with simple bound constraints
