2 papers
math.OC2026
The Minimum Q-Order of BFGS with Exact Line Search Is One
Benqi Liu, Chenyi Li, Zaiwen Wen
Powell asked whether the smoothness assumptions underlying classical superlinear convergence force a fixed power law between adjacent iterates of exact-line-search variable-metric…
math.OC2013
Linearly Convergent First-Order Algorithms for Semi-definite Programming
Cong D. Dang, Guanghui Lan
In this paper, we consider two formulations for Linear Matrix Inequalities (LMIs) under Slater type constraint qualification assumption, namely, SDP smooth and non-smooth formulati…