Computational Optimization and Applications
Improving ultimate convergence of an augmented Lagrangian method
Optimization Methods & Software - Dedicated to Professor Michael J.D. Powell on the occasion of his 70th birthday
Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
Journal of Computational and Applied Mathematics
An active set quasi-Newton method with projected search for bound constrained minimization
Computers & Mathematics with Applications
Second-order negative-curvature methods for box-constrained and general constrained optimization
Computational Optimization and Applications
A multivariate spectral projected gradient method for bound constrained optimization
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
SIAM Journal on Scientific Computing
SMI 2011: Full Paper: A topology-preserving optimization algorithm for polycube mapping
Computers and Graphics
Gradient-Based Methods for Sparse Recovery
SIAM Journal on Imaging Sciences
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
Computational Optimization and Applications
A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
Computational Optimization and Applications
Conjugate gradient method for the linear complementarity problem with S-matrix
Mathematical and Computer Modelling: An International Journal
An active set feasible method for large-scale minimization problems with bound constraints
Computational Optimization and Applications
Evaluating bound-constrained minimization software
Computational Optimization and Applications
Optimizing cellular automata through a meta-model assisted memetic algorithm
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A cyclic projected gradient method
Computational Optimization and Applications
A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
Computational Optimization and Applications
Journal of Computational Physics
An active set truncated Newton method for large-scale bound constrained optimization
Computers & Mathematics with Applications
Hi-index | 0.01 |
An active set algorithm (ASA) for box constrained optimization is developed. The algorithm consists of a nonmonotone gradient projection step, an unconstrained optimization step, and a set of rules for branching between the two steps. Global convergence to a stationary point is established. For a nondegenerate stationary point, the algorithm eventually reduces to unconstrained optimization without restarts. Similarly, for a degenerate stationary point, where the strong second-order sufficient optimality condition holds, the algorithm eventually reduces to unconstrained optimization without restarts. A specific implementation of the ASA is given which exploits the recently developed cyclic Barzilai-Borwein (CBB) algorithm for the gradient projection step and the recently developed conjugate gradient algorithm CG_DESCENT for unconstrained optimization. Numerical experiments are presented using box constrained problems in the CUTEr and MINPACK-2 test problem libraries.