Proposition 8, p. 13 — under the strict CQ (42), M(x̄) = {(ζ̄, Γ̄)} and aff(C(x̄)) = app(ζ̄, Γ̄)
ProvedSunNLSDP.Equiv.proposition_8constraint-qualificationcritical-conenonlinear-semidefinite-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be feasible for (NLSDP) and . Suppose the strict constraint qualification (42) holds:
Then and , where is the critical cone (31) and (38).
Formalization Note. (42) is read as one coupled system: for every there is one with and . This is the reading used in the proof ((43)); read as two separate equations it would be strictly weaker.
Preamble
import Mathlib import Definitions.Def_NonsmoothNewton_Shared_clarkeJac import Definitions.Def_NonsmoothNewton_Local_dirDeriv import Definitions.Def_RobinsonSR_Reduction_Setting import Definitions.Def_SunNLSDP_Equiv_Setting open scoped RealInnerProductSpace Topology open Filter NonsmoothNewton.Shared NonsmoothNewton.Local
Formal statement
namespace SunNLSDP.Equiv
theorem proposition_8 {X : Type*} [NormedAddCommGroup X] [InnerProductSpace ℝ X]
[FiniteDimensional ℝ X] {m : ℕ} {n : Type} [Fintype n] [DecidableEq n]
(P : NLSDP X m n) (xbar : X) (ζbar : EuclideanSpace ℝ (Fin m)) (Γbar : SymMat n)
(hfeas : P.feasible xbar) (hKKT : (ζbar, Γbar) ∈ P.multipliers xbar)
(hstrict : P.StrictCQ xbar Γbar) :
P.multipliers xbar = {(ζbar, Γbar)} ∧
(affineSpan ℝ (P.criticalCone xbar) : Set X) = P.app xbar ζbar Γbar := by sorry
end SunNLSDP.Equiv
Source
Sun, The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications, preprint dated May 15, 2005, p. 13, Proposition 8 (42)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.