Lemma A1 — no nonnegative recession direction of the conjugate
ProvedBregmanPPA.IneqMult.lemmaA1convex-conjugatep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1recession-direction
Let be a closed proper convex extended-valued function that is finite and subdifferentiable at some point of the strictly positive orthant. Then its ordinary conjugate has no nonzero recession direction in the nonnegative orthant:
This exclusion supplies the attainment condition used in Lemma A2.
Formalization Note A recession direction is defined exactly by the paper's limit inferior criterion at every point of the effective domain. Closedness is lower semicontinuity of .
Preamble
import Mathlib import Definitions.Def_BregmanPPA_IneqMult_Program open Filter Topology InertialFB.IFB
Formal statement
namespace BregmanPPA.IneqMult
/-- Lemma A1, p. 223: no nonzero nonnegative recession direction of the conjugate. -/
theorem lemmaA1 {m : ℕ} (F : E m → EReal)
(hproper : IsProperFn F) (hconvex : IsConvexFn F)
(hclosed : LowerSemicontinuous F)
(hu : ∃ u : E m, u ∈ posOrthant m ∧ F u ≠ ⊤ ∧
∃ v : E m, IsSubgradient F u v) :
∀ y : E m, y ∈ nonnegOrthant m → y ≠ 0 →
¬ IsRecessionDirection (conjE F) y := by sorry
end BregmanPPA.IneqMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), p. 223, Lemma A1, https://doi.org/10.1287/moor.18.1.202
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.