Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Joint and frozen-Newton objectives for range-invariant relaxations

Definition

Let X,Y,Z be real Banach spaces, let X0 be a closed linear subspace of X, and let D⊆X contain X0 and a nonempty set U. Fix x0∈X0∩U, a map F:D→Y, a bounded linear map K:Z→Y, and a map r:D→Z such that F(x)−F(x0)=Kr(x) for every x∈D. Assume that r∣U is a bijection from U onto a set U~⊆Z, and that (I−P)r−1(r^)∈X0∩D for every r^∈U~ admitted below. Here I is the identity on X and P:X→X is a bounded linear projection with P2=P, P∣X0=0, and (I−P)(X)⊆X0. Let Rˇ:X0→[0,+∞] be a proper convex regularizer, let RP:P(X)→[0,+∞] be a nonnegative penalty, and let Q:Z×Z→[0,+∞] satisfy Q(a,b)=Q(b,a) and Q(a,b)=0 exactly when a=b. For r^∈U~, set

R(r^):=Rˇ((I−P)r−1(r^))+RP(Pr−1(r^)).

For p∈[1,∞), data yδ∈Y, and parameters α,β>0, the joint relaxed objective is

Jα,βδ(r^,x):=∥Kr^+F(x0)−yδ∥Yp+αR(r^)+βQ(r(x),r^)p+∥Px∥Xp,(r^,x)∈U~×U.

The joint source-condition objective takes RP=0. The term βQ(r(x),r^)p ties the relaxed range variable to the physical variable, while ∥Px∥Xp penalizes the component outside X0.

If r is Gâteaux differentiable at a current iterate xn∈U, the frozen-Newton objective with parameters αn,βn>0 is

Jnδ(r^,x):=∥Kr^+F(x0)−yδ∥Yp+αnR(r^)+βnQ(r(xn)+r′(xn)(x−xn),r^)p+∥Px∥Xp.

Here r′(xn) is the bounded linear Gâteaux derivative used to form the affine range proxy; no minimizer existence or uniqueness is part of either definition.

Depends on

Used by

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources