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 , let be symmetric, let , and let . Every global minimizer of has a multiplier such that Conversely, every feasible 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 and its eigenspace. If , , and the solution of , , has , then is a global minimizer with the singular multiplier . If , both signs of any chosen nonzero of the required length give distinct minimizers.
Facts & Assumptions
Given: , a real symmetric matrix , a vector , a radius , and the trust-region quadratic model and Euclidean conventions of Quadratic trust-region models and the actual-to-predicted reduction ratio.
Quadratic trust-region models and the actual-to-predicted reduction ratio: the feasible set is the closed Euclidean ball and the model differs from only by the constant .
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a real symmetric matrix has an orthonormal eigenbasis.
Positive definite, negative definite, semidefinite, and indefinite quadratic forms: a symmetric matrix is positive semidefinite exactly when for every .
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and : a continuous real-valued function on a closed interval takes every value between its endpoint values.
Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function: finite sums, products, and quotients with nonzero denominators of continuous real functions are continuous on their domains.
Proof
Given: The hypotheses in the Statement.
By [F2], choose an orthogonal matrix such that with . Put and write . Then and , so it suffices to construct a minimizer in these coordinates.
Set and, for , define and . Every denominator is positive, so [F5] gives continuity of . Let . If some has , choose with ; its single term gives . Otherwise for . Then is finite. If , each term with is continuous at by [F5], while each term with is zero for and extends as the constant zero. Thus the extension with value is continuous at , so choose close enough that . In either case with , put and choose . Then for every , giving . By [F4] on , choose with . The vector then has norm , , and is positive definite.
In the remaining case every has and the finite sum in step 2.1 satisfies . Set for and for . If , take ; then is positive semidefinite, , and . If , the zero-denominator coordinates form the least-eigenvalue eigenspace. Add a vector supported on those coordinates with and take . Such a vector exists by scaling a unit eigenvector; it is orthogonal to . Then , , and . This is the hard-case construction.
In either construction, returning to gives a feasible vector and a with , , and . For every feasible , direct expansion gives because the first term is nonnegative by [F3] and the second is zero if and nonnegative otherwise. Thus the constructed vector is a global minimizer.
Conversely, let be any global minimizer. Then , where is the constructed minimizer, and is feasible. Applying the identity in step 4.1 with expresses zero as the sum of two nonnegative terms. In particular, for , . By [F2], diagonalize the symmetric positive semidefinite matrix from step 4.1. In these coordinates the last quadratic form is with every , so for every and . Since , this gives . If , the other nonnegative term in the identity vanishes only when ; if , complementarity is automatic. Thus satisfies all three conditions.
The constructed case has and adds exactly the missing boundary component in ; when its length is positive, opposite choices of are distinct and the same inequality in step 4.1 proves both globally minimizing. This verifies the stated hard-case clause.
Depends on
- Quadratic trust-region models and the actual-to-predicted reduction ratio
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Positive definite, negative definite, semidefinite, and indefinite quadratic forms
- Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on $[a,b]$ takes every value between $f(a)$ and $f(b)$
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
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
- Jorge Nocedal and Stephen J. Wright, Numerical Optimization, second edition (standard reference, not scraped)
- Nick Gould, Continuous Optimization Algorithms, Part 3.2: Trust-Region Methods (standard reference, not scraped)