Sciweavers

Share
SIAMJO
2008

Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints

10 years 4 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. It generalizes recently developed algorithms of quadratic programming constrained by simple bounds. A linear convergence rate in terms of the Hessian spectral condition number is proven. Numerical experiments, including the frictional three-dimensional (3D) contact problems of linear elasticity, illustrate the computational performance. Key words. quadratic function, separable convex constraints, active set, conjugate gradient method, projected gradient, convergence rate AMS subject classifications. 65K05, 90C25 DOI. 10.1137/060670456
Radek Kucera
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where SIAMJO
Authors Radek Kucera
Comments (0)
books