Least-squares migration (LSM) iteratively achieves a mean-square best fit to seismic reflection data, provided that a kinematically accurate velocity model is available. The subsurface offset extension adds extra degrees of freedom to the model, thereby allowing LSM to fit the data even in the event of significant velocity error. This type of extension also implies additional computational expense per iteration from crosscorrelating source and receiver wavefields over the subsurface offset, and therefore places a premium on rapid convergence. We have accelerated the convergence of extended least-squares migration by combining the conjugate gradient algorithm with weighted norms in range (data) and domain (model) spaces that render the extended Born modeling operator approximately unitary. We have developed numerical examples that demonstrate that the proposed algorithm dramatically reduces the number of iterations required to achieve a given level of fit or gradient reduction compared with conjugate gradient iteration with Euclidean (unweighted) norms.