Variational Optimization
Variational optimization minimizes the energy over a parameterized family of states. Unlike a linear Rayleigh–Ritz calculation, the trial manifold can be curved and the objective nonconvex. A vanishing numerical gradient establishes local stationarity within the chosen family; it does not establish the true ground state.
Helpful background. The variational principle supplies the ground-state bound, and Rayleigh–Ritz covers linear coefficients.
Energy gradients on a trial manifold
Section titled “Energy gradients on a trial manifold”For a differentiable, possibly unnormalized state with real parameters, define
Differentiating numerator and denominator, for parameter-independent Hermitian , gives
The residual therefore drives optimization only through directions accessible to the ansatz. The gradient may vanish even when the residual is large, because the missing correction lies outside the tangent space. Energy variance, , gives a complementary diagnostic when it is affordable.
Normalization and global phase are redundant directions. Removing them improves conditioning. Positive widths can be parameterized as , avoiding inadmissible negative values. For orthonormal orbitals, unitary orbital rotations preserve the constraint more reliably than unconstrained entries followed by ad hoc repair.
Gradient checks and optimization steps
Section titled “Gradient checks and optimization steps”Before relying on analytic or automatic derivatives, compare each directional derivative with
In a smooth deterministic calculation, truncation error is while roundoff contributes approximately . A sweep in should reveal a useful plateau. Differentiating through an incompletely converged internal eigensolver can give a different derivative from the converged physical objective.
Use a line search or trust region to control updates; rescale parameters with very different units. Curvature information can accelerate convergence, but nearly redundant parameters make the Hessian ill-conditioned. A state-space metric can expose this redundancy:
where is normalized. Solving requires regularization when has small eigenvalues. Record that regularization, since it changes the update.
A width parameter with an exact minimum
Section titled “A width parameter with an exact minimum”For the dimensionless harmonic oscillator and Gaussian width ,
The minimum is , with and curvature . This tests gradients and positivity constraints simultaneously. Adding a displacement contributes , so the minimum must also recover the parity-symmetric center.
For an anharmonic potential , the same Gaussian gives for . Its stationary equation is . Solving it checks an optimizer against an independent scalar equation while leaving an honest ansatz error.
Convergence and local minima
Section titled “Convergence and local minima”Require agreement of objective, gradient, constraint residual, and repeat starts. Compare an expanded ansatz and selected observables. A smaller energy alone can reflect a better approximation, a broken normalization, or inconsistent quadrature. Stochastic objectives require statistical convergence criteria and belong with variational Monte Carlo; a deterministic line search cannot interpret sampling noise as exact curvature.
Exercises
Section titled “Exercises”For small positive , obtain the optimized Gaussian width and energy through first order in .
Solution
Set in . Then , so . Because the unperturbed energy is stationary at , the width change contributes only at second order; .
References
Section titled “References”- Nocedal, J., and S. J. Wright, Numerical Optimization, 2nd ed., Springer, 2006, doi:10.1007/978-0-387-40065-5 — line searches, conditioning, and constrained optimization.
- Sorella, S., “Generalized Lanczos algorithm for variational quantum Monte Carlo,” Physical Review B 64, 024512 (2001), doi:10.1103/PhysRevB.64.024512 — state-space updates and variational optimization.