§5.1, pp. 151–152 — A and W give and when
ProvedNonsmoothQN.Secant.armijo_wolfe_sign_flipline-searchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1secant-method
Let be an iterate and a search direction with , and let be a step satisfying the two line search conditions of §5.1,
If the new point is nonzero, then
Applied to , , , this says that every step of the secant method on that does not land at the minimizer strictly decreases the function value and crosses zero.
Preamble
import Mathlib import Definitions.Def_NonsmoothQN_Secant_Basic import Definitions.Def_NonsmoothQN_Secant_Expansion
Formal statement
namespace NonsmoothQN.Secant
theorem armijo_wolfe_sign_flip (x p t : ℝ) (hx : x ≠ 0) (hpx : p * x < 0)
(hA : secA x p t) (hW : secW x p t) (hx' : x + t * p ≠ 0) :
|x + t * p| < |x| ∧ x * (x + t * p) < 0 := by sorry
end NonsmoothQN.Secant
Source
Lewis, Overton, Nonsmooth optimization via quasi-Newton methods, Math. Program. Ser. A 141 (2013) 135–163, pp. 151–152, §5.1, the sentence after the definition of A(t) and W(t)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.