Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Global trust-region minimizers satisfy the shifted-Hessian conditions, including the hard case

Statement

Let n≥1, let B∈Rn×n be symmetric, let g∈Rn, and let Δ>0. Every global minimizer p∗ of q(p):=⟨g,p⟩+12pTBpover ∥p∥2≤Δ has a multiplier λ≥0 such that (B+λI)p∗=−g,B+λI⪰0,λ(Δ−∥p∗∥2)=0. Conversely, every feasible p∗ satisfying these conditions is a global minimizer. A global minimizer always exists.

The singular hard case is included as follows. Let μ be the least eigenvalue of B and Eμ its eigenspace. If μ<0, g⊥Eμ, and the solution p0 of (B−μI)p0=−g, p0⊥Eμ, has ∥p0∥2≤Δ, then p∗=p0+z,z∈Eμ,∥z∥22=Δ2−∥p0∥22 is a global minimizer with the singular multiplier λ=−μ. If ∥p0∥2<Δ, both signs of any chosen nonzero z of the required length give distinct minimizers.

Facts & Assumptions

Given: n≥1, a real symmetric matrix B∈Rn×n, a vector g∈Rn, a radius Δ>0, and the trust-region quadratic model and Euclidean conventions of Quadratic trust-region models and the actual-to-predicted reduction ratio.

[F1]

Quadratic trust-region models and the actual-to-predicted reduction ratio: the feasible set is the closed Euclidean ball {p:∥p∥2≤Δ} and the model differs from q only by the constant f(x).

[F3]

Positive definite, negative definite, semidefinite, and indefinite quadratic forms: a symmetric matrix C is positive semidefinite exactly when vTCv≥0 for every v.

[F4]

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2algebra

By [F2], choose an orthogonal matrix U such that D:=UTBU=diag⁡(μ1,…,μn) with μ1≤⋯≤μn. Put c:=UTg and write p=Uy. Then q(Uy)=∑i(ciyi+12μiyi2) and ∥Uy∥2=∥y∥2, so it suffices to construct a minimizer in these coordinates.

2.1step 1.1F4F5algebrachoose

Set λ0:=max⁡(0,−μ1) and, for λ>λ0, define φ(λ):=∑ici2/(μi+λ)2 and yi(λ):=−ci/(μi+λ). Every denominator is positive, so [F5] gives continuity of φ. Let Z:={i:μi+λ0=0}. If some i∈Z has ci≠0, choose λa>λ0 with λa−λ0<∣ci∣/Δ; its single term gives φ(λa)>Δ2. Otherwise ci=0 for i∈Z. Then φ0:=∑i∉Zci2(μi+λ0)2 is finite. If φ0>Δ2, each term with i∉Z is continuous at λ0 by [F5], while each term with i∈Z is zero for λ>λ0 and extends as the constant zero. Thus the extension with value φ0 is continuous at λ0, so choose λa>λ0 close enough that φ(λa)>Δ2. In either case with φ(λa)>Δ2, put S:=∑i∣μi∣ and choose R>max⁡{λa,S+2∥c∥2/Δ}. Then μi+R>2∥c∥2/Δ for every i, giving φ(R)<Δ2/4<Δ2. By [F4] on [λa,R], choose λ>λ0 with φ(λ)=Δ2. The vector yi=−ci/(μi+λ) then has norm Δ, (D+λI)y=−c, and D+λI is positive definite.

3.1step 1.1step 2.1F3algebraconstruct

In the remaining case every i∈Z has ci=0 and the finite sum φ0 in step 2.1 satisfies φ0≤Δ2. Set yi0=−ci/(μi+λ0) for i∉Z and yi0=0 for i∈Z. If λ0=0, take y=y0; then D is positive semidefinite, Dy=−c, and ∥y∥2≤Δ. If λ0>0, the zero-denominator coordinates form the least-eigenvalue eigenspace. Add a vector z supported on those coordinates with ∥z∥22=Δ2−∥y0∥22 and take y=y0+z. Such a vector exists by scaling a unit eigenvector; it is orthogonal to y0. Then (D+λ0I)y=−c, D+λ0I⪰0, and ∥y∥2=Δ. This is the hard-case construction.

4.1step 2.1step 3.1F3givenalgebra

In either construction, returning to p=Uy gives a feasible vector and a λ≥0 with (B+λI)p=−g, B+λI⪰0, and λ(Δ−∥p∥2)=0. For every feasible v, direct expansion gives q(v)−q(p)=12(v−p)T(B+λI)(v−p)+λ2(∥p∥22−∥v∥22)≥0, because the first term is nonnegative by [F3] and the second is zero if λ=0 and nonnegative otherwise. Thus the constructed vector is a global minimizer.

5.1step 4.1F2F3givenalgebrachoose

Conversely, let p∗ be any global minimizer. Then q(p∗)=q(p), where p is the constructed minimizer, and p∗ is feasible. Applying the identity in step 4.1 with v=p∗ expresses zero as the sum of two nonnegative terms. In particular, for H:=B+λI, (p∗−p)TH(p∗−p)=0. By [F2], diagonalize the symmetric positive semidefinite matrix H from step 4.1. In these coordinates the last quadratic form is ∑iνiwi2=0 with every νi≥0, so νiwi=0 for every i and H(p∗−p)=0. Since Hp=−g, this gives Hp∗=−g. If λ>0, the other nonnegative term in the identity vanishes only when ∥p∗∥2=Δ; if λ=0, complementarity is automatic. Thus p∗ satisfies all three conditions.

6.1step 3.1step 4.1∎

The constructed case λ0>0 has g⊥Eμ and adds exactly the missing boundary component in Eμ; when its length is positive, opposite choices of z are distinct and the same inequality in step 4.1 proves both globally minimizing. This verifies the stated hard-case clause.

Depends on

Used by

Dependency tree · two levels

37 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