BFGS for the unit ball

Let gRng\in\mathbb{R}^n be an initial unit vector and let HS++nH\in\mathbb{S}_{++}^n be an initial positive-definite matrix. Repeatedly define

s=Hg,g+=ss,y=g+g,V=IsyTsTy,H+=VHVT+ssTsTy,s=-Hg,\qquad g_+=\frac{s}{\|s\|},\qquad y=g_+-g,\qquad V=I-\frac{sy^T}{s^Ty},\qquad H_+=VHV^T+\frac{ss^T}{s^Ty},

and then update g=g+g=g_+ and H=H+H=H_+.

BFGS for the unit ball. The trial step ss converges to zero.

This conjecture concerns the behavior of the BFGS update when the underlying compact convex set is the unit ball. The preceding discussion establishes determinant decrease for the update in the general membership algorithm, while the convergence of the trial steps in this special case is suggested only by numerical experiments.

Sources & referencesView supporting material

Primary source

Jiayi Guo and Adrian S. Lewis, “Rescaling nonsmooth optimization using BFGS and Shor updates”, arXiv:1802.06453 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.