Currently displaying 1 – 7 of 7

Showing per page

Order by Relevance | Title | Year of publication

Nonmonotone strategy for minimization of quadratics with simple constraints

An algorithm for quadratic minimization with simple bounds is introduced, combining, as many well-known methods do, active set strategies and projection steps. The novelty is that here the criterion for acceptance of a projected trial point is weaker than the usual ones, which are based on monotone decrease of the objective function. It is proved that convergence follows as in the monotone case. Numerical experiments with bound-constrained quadratic problems from CUTE collection show that the modified...

Page 1

Download Results (CSV)