Theorem 9, p. 20 — f, h semiconvex and 0 ∈ M(x̄): no feasible point, or x̄ optimal, or no strictly feasible point
ProvedMifflinSemismooth.Optimality.theorem9Consider the problem of minimizing subject to , with , and the map of §5 ( if , if , if ). Suppose and are semiconvex on and satisfies .
- If , then for all ; that is, the problem has no feasible points.
- If , then at least one of the following holds:
- (i) is optimal;
- (ii) for all ; that is, the problem has no strictly feasible points.
In formulas:
Together with Theorem 7 (optimality implies stationarity) this says that for semiconvex problem functions with a strictly feasible point (a Slater-type condition), stationarity is equivalent to optimality. It is the nonsmooth analogue of the classical sufficiency of the Karush–Kuhn–Tucker conditions for pseudoconvex objective and quasiconvex constraints.
Formalization Note "Semiconvex on " is semiconvexity at each point with respect to . The hypothesis is alone, without feasibility, since case 1 concerns infeasible . The theorem is stated for an arbitrary constraint function ; the paper's is a special case, and Theorem 6 transfers semiconvexity from the to .
import Mathlib import Definitions.Def_MifflinSemismooth_Optimality_Setting
namespace MifflinSemismooth.Optimality
/-- Mifflin (1976), §5, Theorem 9, p. 20: if `f` and `h` are semiconvex on `ℝⁿ` and `0 ∈ M(x̄)`,
then (a) `h(x̄) > 0` implies `h(x) ≥ h(x̄) > 0` for all `x`; (b) `h(x̄) ≤ 0` implies that `x̄` is
optimal or `h(x) ≥ 0` for all `x`. -/
theorem theorem9 {n : ℕ} (f h : EuclideanSpace ℝ (Fin n) → ℝ) (hf : MifflinSemismooth.Extremal.SemiconvexOn Set.univ f)
(hh : MifflinSemismooth.Extremal.SemiconvexOn Set.univ h) (xbar : EuclideanSpace ℝ (Fin n))
(h0 : (0 : EuclideanSpace ℝ (Fin n)) ∈ Mmap f h xbar) :
(0 < h xbar → ∀ x, h xbar ≤ h x ∧ 0 < h x) ∧
(h xbar ≤ 0 → IsOptimal f h xbar ∨ ∀ x, 0 ≤ h x) := by sorry
end MifflinSemismooth.Optimality
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.