We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We present an active-set algorithm for finding a local minimizer to a nonconvex
bound-constrained quadratic problem. Our algorithm extends the ideas developed by Dost al and Sch oberl that is based on the linear conjugate gradient algorithm for (approximately) solving a linear system with a positive-de finite coefficient matrix.
This is achieved by making two key changes. First, we perform a line search along negative curvature directions when they are encountered in the linear conjugate gradient iteration. Second, we use Lanczos iterations to compute approximations to leftmost eigen-pairs, which is needed to promote convergence to points satisfying certain second-order optimality conditions. Preliminary numerical results show that our
method is e fficient and robust on nonconvex bound-constrained quadratic problems
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.