Conjugate Gradient with Subspace Optimization

Details Conjugate Gradient with Subspace Optimization Conjugate Gradient with Subspace Optimization

2012-02-07

arxiv.org/abs/1202.1479v1

Mathematics

Optimization and Control

Scientific paper

In this paper we present a variant of the conjugate gradient (CG) algorithm in which we invoke a subspace minimization subproblem on each iteration. We call this algorithm CGSO for "conjugate gradient with subspace optimization". It is related to earlier work by Nemirovsky and Yudin. We apply the algorithm to solve unconstrained strictly convex problems. As with other CG algorithms, the update step on each iteration is a linear combination of the last gradient and last update. Unlike some other conjugate gradient methods, our algorithm attains a theoretical complexity bound of $O(\sqrt{L/l} \log(1/\epsilon))$, where the ratio $L/l$ characterizes the strong convexity of the objective function. In practice, CGSO competes with other CG-type algorithms by incorporating some second order information in each iteration.

Affiliated with

Also associated with

No associations

Rating

Conjugate Gradient with Subspace Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Conjugate Gradient with Subspace Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conjugate Gradient with Subspace Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-579707