§3.2, proof of Corollary 3.5, p. 485 — upper semicontinuity: V ⊂ int(dom g*) with ∂g*(V) ⊂ U ∩ dom g
ProvedTaoAnDCA.LocalOpt.exists_nhds_subdiff_conj_subsetconjugatedc-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subdifferentialupper-semicontinuity
Let satisfy the standing inclusions and . Let and let be an open set such that
Then has a neighbourhood such that
in particular .
This is the upper semicontinuity step of the proof of Corollary 3.5: it turns the pointwise condition (12) at into a condition on a whole neighbourhood of , which is what the dual application of Theorem 3.2(ii) needs.
Formalization Note. is required to be open: upper semicontinuity of gives inside any open set containing , and (12) supplies such an open set only when is open. Of the standing assumptions only matters here.
Preamble
import Mathlib import Definitions.Def_TaoAnDCA_LocalOpt_Setting open Filter Topology
Formal statement
namespace TaoAnDCA.LocalOpt
/-- §3.2, proof of Corollary 3.5, p. 485 (upper semicontinuity of `∂g*`): if
`y* ∈ int (dom g*)` and `∂g*(y*) ⊂ U` with `U` open, then `y*` has a neighbourhood
`V ⊂ int (dom g*)` with `∂g*(V) ⊂ U`, and more precisely `∂g*(V) ⊂ U ∩ dom g`. -/
theorem exists_nhds_subdiff_conj_subset {n : ℕ} (g h : EuclideanSpace ℝ (Fin n) → EReal)
(hgh : TaoAnDCA.GlobalOpt.DCStanding g h) (ys : EuclideanSpace ℝ (Fin n)) (U : Set (EuclideanSpace ℝ (Fin n)))
(hU : IsOpen U) (h12a : ys ∈ interior (TaoAnDCA.GlobalOpt.effDom (CondatPD.FinDim.conj g)))
(h12b : TaoAnDCA.GlobalOpt.subdiff (CondatPD.FinDim.conj g) ys ⊆ U) :
∃ V ∈ 𝓝 ys, V ⊆ interior (TaoAnDCA.GlobalOpt.effDom (CondatPD.FinDim.conj g)) ∧
∀ y ∈ V, TaoAnDCA.GlobalOpt.subdiff (CondatPD.FinDim.conj g) y ⊆ U ∩ TaoAnDCA.GlobalOpt.effDom g := by sorry
end TaoAnDCA.LocalOpt
Source
Pham Dinh & Le Thi, A d.c. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim. 8 (1998), p. 485, §3.2, proof of Corollary 3.5, third and fourth sentences, with (12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.