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.
Finite element pde constrained optimization
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Céa and Aubin–Nitsche error estimates
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Convex and Semicontinuous Functions on Rⁿ
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Surface Measure, Divergence, and Green Identities
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-element meshes and interpolation
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fredholm Elliptic Problems and the Elliptic Spectrum
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Harmonic Functions and Mean Values in Rn
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inequality KKT duality and optimality certificates
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nonconvex line search and inexact newton methods
- Nonlinear equations and Newton methods
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Parabolic finite-element methods
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Proximal gradient and accelerated composite optimization
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Splitting Fields
- Sqp active set and augmented lagrangian methods
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Direct Method and Euler--Lagrange Equations
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Variational crimes and Strang lemmas
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak and Weak Star Topologies
- Weak Derivatives and Sobolev Spaces
2 · Summary
For a bounded coercive linear elliptic state equation with distributed controls, this page defines a closed pointwise box and a quadratic tracking objective with regularization , . The state space uses the full norm, and its Hilbert property under Countable Choice is proved locally. The page proves state and adjoint well-posedness, differentiates the reduced objective, and gives existence, uniqueness, the variational inequality, and the pointwise clipping formula. The Hilbert-space existence argument states its Countable Choice and separability inputs explicitly.
The finite-element section distinguishes cellwise-constant control discretization from variational control discretization. The result assumes control regularity, a uniform bound for the projected adjoint, an adjoint-consistent finite-element reduced objective, and a complete first-Strang gradient-residual ledger. The conditional result requires adjoint consistency for its discrete objective, actual primal and adjoint regularity, matching dual approximation, uniform state/adjoint errors, and every form, load, geometry, and quadrature defect at the stated order. It makes no rate claim on arbitrary Lipschitz or reentrant domains.
The finite-loop projected-gradient method optimizes the exact continuous PDE objective over a cellwise-constant control box while using finite-return state/adjoint and projection routines with explicit Strang bounds and exact projected cell values and residual; failure of either routine returns an inconclusive status. Its certified status bounds the exact projected-gradient residual; a separate theorem converts that residual to distance from the restricted optimum. The exhaustive active-set algorithm is an exact-arithmetic finite-dimensional reference. The SQP branch returns the QR-computed step and reports only a certified active linear-system residual unless feasibility, complementarity, conditioning, and the required local hypotheses are separately verified. The parabolic extension assumes a real evolution triple with separable energy space . It is a separate energy-space result and does not inherit an elliptic finite-element rate.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Closed pointwise box of L2 controls
Definition
Let be a bounded Lebesgue-measurable set. Let with inner product
and the corresponding norm. This is a real Hilbert space by with the integral pairing is a Hilbert space under Countable Choice The Axiom of Countable Choice ().
For bounds with almost everywhere, define the admissible box
Equalities and inequalities between controls are understood as almost-everywhere statements about their classes. The box is nonempty because it contains . When a finite-element control space is used, its cellwise-constant admissible set is the intersection of this box with the stated piecewise-constant subspace; cellwise averaging preserves the box when both bounds are constant on each control cell.
A bounded sequence in a separable Hilbert space has a weakly convergent subsequence
Statement
Assume Countable Choice. Let be a separable real Hilbert space and let be a sequence with for some finite . Then there are a strictly increasing sequence of indices and such that weakly in .
Facts & Assumptions
Given: Countable Choice, a separable real Hilbert space , and a sequence with .
Every nested sequence of nonempty closed bounded real intervals whose lengths tend to zero has a unique common point (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to ).
Every bounded linear functional on a Hilbert space is represented by a unique vector under Countable Choice (Riesz representation for Hilbert spaces, The Axiom of Countable Choice ()).
Cauchy–Schwarz gives (Cauchy–Schwarz: , with equality exactly for dependent pairs).
A separable space has an at most countable dense subset, and “countable” means finite or countably infinite; such a nonempty subset can be listed as a sequence, repeating a finite list when necessary (Separability: the existence of an at most countable dense subset, Finite, countably infinite, countable, uncountable).
Proof
By separability choose a dense subset that is at most countable. It is nonempty because contains . If is finite, a finite listing from its bijection with a natural number, repeated periodically, gives a sequence; if is countably infinite, a bijection with gives a sequence. Thus [F4] supplies a dense sequence without any choice principle beyond the witnesses in the definition of countability.
For any bounded real sequence in , start with . At each stage split the current interval into its two closed halves and choose the left half if it contains infinitely many terms of the current sequence, and otherwise choose the right half. At least one half contains infinitely many terms. Choose the least index later than the preceding selected index whose term lies in the chosen half. The resulting nested intervals have lengths tending to zero, so [F1] gives a common point, and the selected subsequence converges to it. Every choice in this construction is the least natural index or the leftmost of two alternatives, so the extraction is determined by its input sequence.
For each , the scalar sequence is bounded by by [F3]. Apply the deterministic extraction in step 1.2 successively to these coordinate sequences, each time inside the previously obtained subsequence. This recursive rule produces nested infinite subsequences on which the first, first two, and then first pairings converge, respectively. Let be the th index of . Nestedness makes strictly increasing, and for each fixed the sequence converges because its tail is a subsequence of .
For any , choose arbitrarily close to . For indices , [F3] gives The first term tends to zero as for fixed , and the second can be made arbitrarily small by density. Thus converges for every . Its limit is linear and satisfies , so is a bounded linear functional. By [F2] there is a unique with for all . Therefore .
Remarks
The subsequence extraction itself uses a deterministic interval bisection and no choice function. Countable Choice is stated because the Riesz representation supplier requires it.
Finite exhaustive active-set solve for a box-constrained positive quadratic
Definition
Let be symmetric positive definite, , and with . For , enumerate the finite set of status vectors in lexicographic order. For each status, set if , set if , and for the free indices solve
where . Skip a singular solve. Retain a candidate only if for , and the gradient satisfies on , on , and on . Return the first retained candidate; if none is retained, return no-candidate. Computations in this definition are exact real arithmetic. If , that coordinate may be assigned status or .
A pointwise L2 box is nonempty, bounded, closed, and convex
Statement
Let be as in Closed pointwise box of L2 controls, and let satisfy almost everywhere. Then is nonempty, convex, norm closed, and bounded in .
Facts & Assumptions
Given: The finite-measure control domain , bounds with almost everywhere, and the definition of .
Proof
The control belongs to because almost everywhere, so is nonempty. If and , then almost everywhere; hence the convex combination is in . The pointwise inequality also gives almost everywhere for each , so and the box is bounded.
Suppose and in . For almost every , , so almost everywhere, where . Therefore and almost everywhere. Similarly gives almost everywhere. Thus and the box is norm closed.
L2 controls on a bounded spatial region form a separable Hilbert space
Statement
Assume Countable Choice. Let be bounded and Lebesgue measurable. Then with its integral inner product is a separable real Hilbert space.
Facts & Assumptions
Given: Countable Choice; the bounded measurable domain and the real convention.
Rational box-step functions form a countable dense subset of under Countable Choice (Rational box-step functions form a countable dense subset of for ).
Extending a function on by zero preserves its norm; restriction from to cannot increase the norm.
with its integral pairing is a real Hilbert space under Countable Choice ( with the integral pairing is a Hilbert space, The Axiom of Countable Choice ()).
Proof
Define by zero extension and by restriction. The maps are well-defined on almost-everywhere classes, is the identity on , and .
Let be the countable dense rational box-step family from [F1]. The set is countable. For , choose any and extend it by . By density there is with ; then . Thus is dense in , proving separability.
The integral pairing makes a real Hilbert space by [F3], so it is both separable and Hilbert. Countable Choice is the only stated choice principle in [F1] and [F3].
Linear coercive elliptic PDE control problem and reduced objective
Definition
Let be a bounded Lipschitz domain, , and . Use the real integral pairing on . Equip with the standard full Sobolev inner product and norm Here is the closure of in the norm of Zero-boundary Sobolev space as a norm closure. Under Countable Choice, and are real Hilbert spaces; the local proof of completeness of is included in Well-posedness of elliptic control state and adjoint equations ↗. The inclusion is continuous with .
Let be bounded and measurable, with its real integral inner product, and let be the pointwise box of Closed pointwise box of L2 controls. Under Countable Choice, is a real Hilbert space by with the integral pairing is a Hilbert space. Let be bilinear, bounded with constant , and coercive with constant in the stated norm; symmetry is not assumed. Let be bounded and linear, and fix , , and .
For every , the state is required to satisfy
The reduced objective, defined on all of and minimized over , is
A spatially varying coefficient, boundary control, variational crimes, finite-element control discretization, and parabolic evolution are separate hypotheses or branches; none is implicit in this definition. The state well-definedness is supplied by Well-posedness of elliptic control state and adjoint equations ↗.
The L2 projection onto a pointwise box is clipping
Statement
Let be as in Closed pointwise box of L2 controls, and let . Define
Then is the unique minimizer of over . Equivalently, if and only if
Facts & Assumptions
Given: The finite-measure control domain, the bounds with almost everywhere, and .
The admissible set consists of the functions satisfying almost everywhere (Closed pointwise box of L2 controls).
Proof
Put . This function is measurable and lies between and ; therefore and . For real numbers , the clipped value satisfies for every : if , then and both factors are nonnegative; if , then and the product is zero; if , then and both factors are nonpositive. Applying this pointwise with and and integrating gives for every .
For any , Thus minimizes the distance and equality can hold only when in . Conversely, if is a distance minimizer, then for any and , . Expanding , dividing by , and letting gives .
The exhaustive box quadratic solve returns the unique minimizer in finite time
Statement
For a nonempty box and positive-definite , the exact algorithm of Finite exhaustive active-set solve for a box-constrained positive quadratic returns the unique minimizer of after at most status checks.
Facts & Assumptions
Given: A finite-dimensional nonempty box, a symmetric positive-definite Hessian, and exact arithmetic for the stated algorithm.
The algorithm enumerates all status vectors and retains precisely candidates with coordinates fixed at their assigned lower or upper bounds, free coordinates strictly between their bounds, and the lower/free/upper gradient signs stated in its definition (Finite exhaustive active-set solve for a box-constrained positive quadratic).
The Euclidean extreme-value theorem gives a minimizer of a continuous function on a compact box (Semicontinuous extreme value theorem on compact Euclidean sets).
The box is nonempty and all arithmetic and comparisons in the algorithm are exact.
Proof
The box is compact and is continuous, so [F2] supplies a minimizer . If and , the feasible right derivative is ; if , the feasible left derivative gives ; and if , both signs of perturbation are feasible, so . For a fixed coordinate with , assign lower status if and upper status if (either if ).
Assign each nonfixed coordinate of its lower, upper, or free status according as it is at the lower bound, at the upper bound, or strictly between them; assign fixed coordinates as in step 1.1. Every nonempty principal block is positive definite: for , extend by zeros to to get . Hence is nonsingular; if , its system is vacuous. The free subsystem has the unique solution by its zero free gradient. Thus the algorithm recovers , whose free coordinates are strictly interior by their assignment and whose gradient signs hold by step 1.1. It is retained by [F1], so the algorithm terminates within checks.
Let be a retained candidate and . For any feasible , the checked coordinate signs give on lower-active coordinates, the same inequality on upper-active coordinates, and zero on free coordinates; hence . The exact expansion is nonnegative, and is strictly positive when because is positive definite. Thus every retained candidate is the unique minimizer, so the first one returned by the algorithm is.
The L2 projection onto a cellwise constant box clips cell averages
Statement
Assume Countable Choice. Let be a bounded polyhedral open control domain and let be a finite matching affine simplicial mesh of as in Matching affine simplicial meshes and shape regularity. Let be the subspace of functions constant on each cell. Let the bounds in Closed pointwise box of L2 controls be constant on each cell and satisfy . Put . For define
where . Then is the unique -nearest point in to , and is nonexpansive: .
Facts & Assumptions
Given: Countable Choice; the finite matching partition into nondegenerate simplices; ; and cellwise constant ordered bounds.
The continuous box consists of the functions between its bounds almost everywhere (Closed pointwise box of L2 controls); intersecting it with gives independent closed intervals for the cell values.
The mesh is a finite collection of nondegenerate cells with disjoint interiors covering up to measure-zero facets (Matching affine simplicial meshes and shape regularity).
Every facet lies in an affine hyperplane, and every affine hyperplane is Lebesgue null; hence the finite union of mesh facets is null (Every affine hyperplane of , and hence every proper linear subspace, is Lebesgue null).
Hölder with exponents shows that each function is integrable on a finite-measure cell, so the cell averages are finite (Holder's inequality for integrals, including the endpoint cases).
Proof
For a cell , [F4] makes finite. For any constant value , because the cross term vanishes by . The second term is independent of .
Among real , the square is uniquely minimized by the clipped value: if is below the interval the nearest endpoint is the lower bound; if it is inside, it is itself; if it is above, the nearest endpoint is the upper bound. Thus the displayed cell value uniquely minimizes the cell integral, and it lies in the required interval by [F1].
The cell choices are independent, so summing the cellwise minima from step 2.1 over the partition up to its null facets [F3] proves that is the unique global minimizer. For , convexity makes feasible, where and . Minimality gives Divide by and let to obtain the projection variational inequality .
Let and . Apply the variational inequality from step 3.1 with and , respectively. Adding gives . Hölder with exponents then yields when ; if the inequality is immediate.
A pointwise L2 box is weakly sequentially closed
Statement
Let and be as in Closed pointwise box of L2 controls. If and weakly in , then .
Facts & Assumptions
Given: A bounded measurable , with almost everywhere, a sequence , and weak convergence .
On finite-measure , Hölder with exponents makes products of functions integrable (Holder's inequality for integrals, including the endpoint cases).
A nonnegative measurable function has integral zero exactly when it vanishes almost everywhere (A nonnegative measurable function has integral exactly when it vanishes almost everywhere).
Proof
Let . Since is bounded, choose with . The single-box cover in the definition of Lebesgue outer measure gives , so . If had positive measure, would be nonnegative, integrable by [F2], and positive on a set of positive measure. Thus [F3] gives . Weak convergence tested against gives , contradicting . Therefore almost everywhere.
Let . As in step 1.1, . If had positive measure, would be nonnegative, integrable by [F2], and positive on a set of positive measure. Thus [F3] gives . Weak convergence tested against gives , contradicting . Therefore almost everywhere, and [F1] gives .
Well-posedness of elliptic control state and adjoint equations
Statement
Assume Countable Choice and the setting of Linear coercive elliptic PDE control problem and reduced objective. For every , there is a unique state satisfying
and
For every , there is also a unique adjoint satisfying
with
Facts & Assumptions
Given: Countable Choice, the normed spaces and data of Linear coercive elliptic PDE control problem and reduced objective, and the bounded real bilinear form and operator in that definition.
The form satisfies and ; symmetry is not assumed (Linear coercive elliptic PDE control problem and reduced objective, Bounded, coercive and symmetric sesquilinear forms).
Lax–Milgram under Countable Choice gives a unique for every bounded linear functional with and (The Lax--Milgram theorem, The Axiom of Countable Choice ()).
Under Countable Choice, real with its integral inner product is a Hilbert space ( with the integral pairing is a Hilbert space).
uses the norm with components and the weak-derivative test identity; is its closed norm closure of (Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure). A weak derivative value is unique as an almost-everywhere class under Countable Choice (Uniqueness of a weak derivative as an almost-everywhere class).
Compactly supported smooth tests and their first derivatives are in because is bounded and bounded Lebesgue measurable sets have finite measure. Every class is locally integrable by Cauchy–Schwarz on compact subsets, and the inner product obeys Cauchy–Schwarz (Lebesgue measure is sigma-finite, and every metrically bounded subset of has finite outer measure, Cauchy–Schwarz: , with equality exactly for dependent pairs).
Proof
The weak-derivative test identities are linear, and [F4] makes each derivative coordinate intrinsic, so is a vector space with the inner product induced from ; it induces the displayed full Sobolev norm and is definite because its zeroth coordinate is . Let be Cauchy in this norm. Its function coordinates and each of its finitely many weak-derivative coordinates are Cauchy in because each coordinate norm is bounded by the full norm. By [F3], there are with and in for each .
For every and , the weak-derivative identity for is . By [F5], both test functions are in ; Cauchy–Schwarz lets both integrals pass to the limits in [F3], giving . Thus each is a weak derivative of . By uniqueness in [F4], as an class, and the component convergences from step 1.1 give in the full norm. Hence is complete.
By [F4], is the closure of the linear space in . It is therefore a closed linear subspace of that complete space, and the inherited inner product is exactly the one in Linear coercive elliptic PDE control problem and reduced objective. Thus is a real Hilbert space under Countable Choice.
For fixed , the functional is bounded and linear, with . Applying [F2] to and now gives the unique state and the stated bound.
Define the adjoint form . It is bounded with the same constant , and , so it is coercive with the same . The functional is bounded by . Apply [F2] to and ; the result is the unique with and the stated bound. No symmetry of is used.
Steps 1.1, 2.1, and 3.1 establish the real Hilbert structure required by [F2] using Countable Choice through the real completeness result [F3]. Steps 4.1 and 5.1 give the state, adjoint, uniqueness, and both estimates.
Reduced gradient and coercive Hessian for linear elliptic tracking control
Statement
Assume the setting of Linear coercive elliptic PDE control problem and reduced objective and Countable Choice. Let be the linear part of the state map, so . Then is Fréchet differentiable on , with
where is the adjoint from Well-posedness of elliptic control state and adjoint equations and is defined by
Its Hessian is the bounded self-adjoint operator , and for every ,
Consequently is Lipschitz with constant , and is -strongly convex.
Facts & Assumptions
Given: The bounded coercive state equation, , , the data, Countable Choice, and the state and adjoint solutions.
The state and adjoint exist uniquely; when is the state variation (Well-posedness of elliptic control state and adjoint equations).
Every bounded linear functional on a Hilbert space has a unique Riesz representative under Countable Choice (Riesz representation for Hilbert spaces, The Axiom of Countable Choice ()).
A bounded linear map between Hilbert spaces has a unique bounded Hilbert adjoint, defined by the inner-product identity (A bounded linear operator between normed spaces, Riesz representation for Hilbert spaces).
Proof
For , let . Subtracting the two state equations gives for all , so depends linearly and boundedly on by the state estimate in [F1]. Thus is a bounded linear map from to . The functional is bounded, so [F2] gives the unique in the displayed definition.
Expanding the two squared norms in yields The adjoint equation with and the state variation equation with test give . The last two terms are bounded by a constant times , so the Fréchet derivative is .
Since the state map is affine with linear part , the same exact expansion at any shows the second derivative is , represented by . Hence and . The constant Hessian gives the stated Lipschitz-gradient bound; the exact quadratic expansion gives strong convexity.
Remarks
This is a local proof of the elliptic adjoint derivative interface. Related parameter-dependent adjoint and gradient-error results are collected on the discrete-continuous-and-pde-adjoint-sensitivities page.
Existence, uniqueness, and variational inequality for elliptic PDE control
Statement
Assume Countable Choice and the setting of Linear coercive elliptic PDE control problem and reduced objective. Then has a unique minimizer . It is characterized by
where is the adjoint from Well-posedness of elliptic control state and adjoint equations. Conversely, every satisfying this variational inequality is the unique minimizer.
Facts & Assumptions
Given: Countable Choice, the nonempty pointwise box , the bounded coercive state problem, and the reduced objective .
is nonempty, bounded, norm closed, and weakly sequentially closed (A pointwise L2 box is nonempty, bounded, closed, and convex, A pointwise L2 box is weakly sequentially closed).
Every bounded sequence in the separable real Hilbert control space has a weakly convergent subsequence (A bounded sequence in a separable Hilbert space has a weakly convergent subsequence, L2 controls on a bounded spatial region form a separable Hilbert space).
The state map is affine with bounded linear part , and (Reduced gradient and coercive Hessian for linear elliptic tracking control).
A Fréchet minimizer over a convex set has nonnegative directional derivative along every feasible segment; here that derivative is (Reduced gradient and coercive Hessian for linear elliptic tracking control).
Countable Choice permits the indexed selection of a minimizing sequence from the nonempty sets for (The Axiom of Countable Choice ()).
Proof
The box is nonempty by [F1], so is finite: and . For every , the defining property of the infimum makes the set in [A1] nonempty. By Countable Choice choose with . Since and , the sequence is bounded. By [F2], applied to its positive-indexed tail, a subsequence converges weakly to some , and [F1] gives .
If minimizes, fix . Convexity gives for . Minimality makes the right directional quotient nonnegative for every ; letting and using [F4] proves the variational inequality.
Write . Bounded linear maps preserve weak convergence, so along the subsequence this state residual converges weakly in to ; the controls converge weakly in . The Hilbert norm is weakly lower semicontinuous: if , then , while the case is immediate. Applying this to both squared norms in gives . Thus attains the infimum.
The exact expansion in [F3] shows strict convexity: for distinct and , The last subtracted term is positive, so two different minimizers in the convex box cannot exist.
Conversely, if satisfies the variational inequality, then for every the exact expansion [F3] gives Thus is a minimizer; step 3.1 gives uniqueness.
Remarks
The existence proof uses Countable Choice to select a minimizing sequence and the stated separable-Hilbert weak subsequence lemma. It uses no Axiom of Choice, Hahn–Banach separation, or reflexive-space compactness theorem.
Cell averaging preserves constant box bounds and has an H1 error bound
Statement
Assume Countable Choice. Let be a nonempty bounded polyhedral open control domain, and let be a family of matching affine simplicial meshes of as in Matching affine simplicial meshes and shape regularity. Set . For every define
Then is the orthogonal projection onto the cellwise-constant space. For every ,
where depends only on dimension and the fixed reference simplex. If additionally the box bounds are constant on each cell and , then .
Facts & Assumptions
Given: Countable Choice; the affine simplex mesh convention; for orthogonal projection and for the error estimate; and, only for box preservation, cellwise-constant bounds with almost everywhere.
A cell map is an affine bijection from the fixed reference simplex, and the cells have disjoint interiors (Matching affine simplicial meshes and shape regularity).
Affine pullback transports weak derivatives and Sobolev seminorms by the matrix and determinant factors (Affine pullback of weak derivatives and Sobolev seminorms).
On the reference simplex, subtracting the cell mean leaves an norm bounded by a constant times the seminorm (Poincare–Wirtinger inequality on a reference simplex).
Hölder with exponents makes each function integrable on the finite-measure cell, so its mean is finite (Holder's inequality for integrals, including the endpoint cases).
Change of variables holds for nonnegative measurable integrands; applying it to the positive and negative parts gives the formula for the integrable real function (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions).
Every mesh facet lies in a Lebesgue-null affine hyperplane, so the finite union of facets is null (Every affine hyperplane of , and hence every proper linear subspace, is Lebesgue null).
Countable Choice is the stated hypothesis of [F2] and [F3] (The Axiom of Countable Choice ()).
Proof
By [F4], the cell means are finite, and finitely many finite cell values define an element of the cellwise-constant subspace of . For every cellwise-constant , by the mean identity. Summing over cells, ignoring the null facets by [F6], gives , proving the orthogonal-projection property for all . If additionally , integration and division by place each mean in that interval; hence .
Fix a cell with affine map and write . By [F5], change of variables applied to and gives the signed integral formula; [F6] lets us ignore the cell facets. Hence , the mean of on the reference simplex. By [F3], By [F2], , and from the fixed reference simplex geometry. Thus .
Square the cell estimates in step 1.2 and sum over cells; the interiors are disjoint and their omitted facets are null by [F6]. Since , the sum is at most . Taking square roots proves the global bound.
State and adjoint Strang bounds give a reduced-gradient error certificate
Statement
Assume the continuous problem of Linear coercive elliptic PDE control problem and reduced objective, Countable Choice, and a finite-dimensional conforming subspace . Let and be the exact state and adjoint. Let be computed state and adjoint, where uses in its right-hand side. Suppose the primal and transposed discrete variational problems meet the form-linearity, load-linearity, boundedness and coercivity hypotheses of First Strang estimate for conforming perturbed Galerkin problems. Let be the first-Strang right-hand side for the primal problem, and let be that right-hand side for the adjoint problem when its load defect includes the additional term . Then
The Strang terms retain best-approximation, quadrature/geometry form defects, and load defects; no defect is silently set to zero.
Facts & Assumptions
Given: The exact state and adjoint; the perturbed conforming state and adjoint equations; uniform discrete coercivity; and the primal/adjoint Strang bounds defined in the Statement.
The exact state and adjoint satisfy the equations in Linear coercive elliptic PDE control problem and reduced objective and Well-posedness of elliptic control state and adjoint equations.
The first Strang estimate is for each bounded coercive real bilinear exact form and its bounded coercive conforming real bilinear discrete form, with bounded linear loads (First Strang estimate for conforming perturbed Galerkin problems).
The reduced gradient is and (Reduced gradient and coercive Hessian for linear elliptic tracking control).
Proof
Apply [F2] to the exact state equation and the computed state equation. By the definition of , this gives . The adjoint load formed with differs from the exact adjoint load by the functional whose norm is at most . Including this term in the adjoint load defect and applying [F2] to the transposed form gives .
The exact reduced gradient is by [F3], and the computed one is . Therefore The displayed certificate includes every Strang approximation and consistency term used to form .
Remarks
For exact conforming Galerkin equations, the form and load defects vanish and the Strang bounds reduce to the matching Céa estimates. For quadrature or geometry approximations, the corresponding defects remain in and .
The optimal elliptic control is the clipped negative adjoint
Statement
For the unique minimizer in Existence, uniqueness, and variational inequality for elliptic PDE control, with adjoint , one has
Facts & Assumptions
Given: The linear-quadratic reduced objective, the nonempty closed convex box , its unique minimizer , and .
The minimizer is characterized by for every (Existence, uniqueness, and variational inequality for elliptic PDE control).
The unique projection onto is pointwise clipping and is characterized by its variational inequality (The L2 projection onto a pointwise box is clipping).
Proof
Divide the variational inequality in [F1] by and rewrite it as This is exactly the projection variational inequality in [F2] for projecting onto .
By the explicit formula in [F2], the projection is pointwise clipping to almost everywhere. Substitution gives the displayed formula.
Finite-budget projected-gradient loop with state-adjoint residual certificates
Definition
Assume Countable Choice. Let , , be a bounded polyhedral open control domain with a finite matching affine simplicial mesh as used in The L2 projection onto a cellwise constant box clips cell averages. Let be the finite-dimensional space of cellwise-constant controls on this mesh, and let be nonempty with bounds constant on each control cell. The target is the exact continuous reduced objective of Linear coercive elliptic PDE control problem and reduced objective, restricted to ; write and . Choose finite certified bounds and . Given a finite budget , tolerance , and initial , repeat for :
Fix a finite-dimensional conforming state space and the discrete primal and transposed adjoint equations satisfying the first-Strang hypotheses in State and adjoint Strang bounds give a reduced-gradient error certificate at each queried control. An additional input is a residual-evaluation routine . For every queried , it must return in finite time either a valid tuple or failure. A valid tuple has solving the specified discrete primal and transposed adjoint equations, with the adjoint right-hand side formed using , and nonnegative finite bounds that dominate the complete primal and adjoint first-Strang right-hand sides. Those bounds retain all form, geometry, quadrature, and load defects, including the adjoint load contribution from the state error. The finite-return condition is part of the algorithm's admissible input contract; if the backend cannot certify the equations and bounds, it returns failure.
A second input is a projection-evaluation routine . Write . For every queried it must return in finite time either failure or finite real cell values and a finite real satisfying
Thus the returned cellwise function is exactly and is its exact step norm by The L2 projection onto a cellwise constant box clips cell averages. Computing the required cell averages, clipped values and norm is part of this finite-return backend contract; it is not inferred from boundedness of , and no finite representation of the entire function is assumed. Unavailable exact values must be reported as failure, not left pending.
- Call . If it returns
failureor no valid bounds, return . Otherwise use its conforming finite-element state and adjoint approximations and complete Strang bounds . Set and . - Call . If it returns
failureor no valid cell values and norm, return . Otherwise set and from its valid return. - If , return .
- Otherwise set and continue.
If all iterations finish without that test, return the last evaluated iterate . Both routines' finite-return contracts ensure that an unavailable state/adjoint bound or projection/residual value is reported as failure rather than left pending. The reported number certifies a projected-gradient residual for the exact continuous PDE objective restricted to ; it is not a continuous-control discretization error bound.
Piecewise-constant control with shape-regular finite elements has O(h) error
Statement
Assume Countable Choice and the elliptic control problem of Linear coercive elliptic PDE control problem and reduced objective on a shape-regular affine simplicial mesh family, with cellwise-constant box bounds and P1 conforming state and adjoint spaces. Let be the cellwise-constant control space and . For each , let be the chosen affine finite-element state map, and define the finite-element reduced objective on by
Let be its associated discrete adjoint. Require adjoint consistency for this same state map and objective, namely
Write and . Let be the continuous minimizer and the minimizer of over . Assume , the projected adjoints satisfy uniformly in , and the exact state/adjoint finite-element gradient error obeys
The last bound is supplied by State and adjoint Strang bounds give a reduced-gradient error certificate when its state and adjoint approximations are the same and used in and the stated primal/adjoint P1 approximation errors and every Strang form/load defect are uniformly over . Then there is a constant independent of such that
Facts & Assumptions
Given: The unique continuous minimizer and its variational inequality; the discrete objective and adjoint-consistency identity in the Statement; its minimizer on ; the cell-average projection ; ; the uniform projected-adjoint bound; and the gradient error bound in the Statement.
The continuous gradient is strongly monotone: (Reduced gradient and coercive Hessian for linear elliptic tracking control).
The continuous minimizer satisfies for all (Existence, uniqueness, and variational inequality for elliptic PDE control). Since minimizes the differentiable objective on the convex set , the adjoint-consistency identity gives for every .
, , and is orthogonal to every element of (Cell averaging preserves constant box bounds and has an H1 error bound).
The adjoint-consistency identity gives for the same objective. Its error obeys , and (State and adjoint Strang bounds give a reduced-gradient error certificate, Cell averaging preserves constant box bounds and has an H1 error bound).
The dual regularity, uniform primal/adjoint approximation, and Strang defects are such that the two bounds in [F4] hold uniformly as .
Proof
Put . By [F1], Replace by at a cost at most by [F4]. The continuous variational inequality in [F2] gives . The discrete variational inequality with the feasible test gives Since and , orthogonality in [F3] cancels the regularization term. Orthogonality also lets us subtract from the remaining factor. Hence
Since every mesh cell is a nondegenerate simplex, . Let and divide the inequality in step 1.1 by to obtain Thus is at most the positive root which is independent of . The resulting upper bound for is independent of , proving the estimate.
Remarks
The finite-element contribution is carried by the exact gradient residual bound. For exact geometry and Galerkin forms it reduces to the matching primal and adjoint energy estimates; a variational crime contributes its full Strang form and load defects. The control regularity is essential to the cell-average term.
Parabolic linear-quadratic control has an energy adjoint and reduced gradient
Statement
Assume Countable Choice. Let and let be bounded and Lebesgue measurable. Let be a real Gelfand triple with separable, and let have the continuous -valued trace supplied by The evolution-space energy identity and continuous H trace. Let be measurable, uniformly bounded and coercive as in Well-posedness for measurable coercive parabolic forms. Let , let be bounded and linear, and let for , . For fixed , , and , define the unique state by
where and , and define
Then for every the adjoint uniquely solves
and is Fr'echet differentiable with
Define by for every ; boundedness of and Hilbert-space Riesz representation make it well-defined. The formula requires the terminal/initial traces and time-dependent form hypotheses above; it asserts no finite-element error rate. For the separate finite-element error splitting, assume additionally , is finite-dimensional, and in operator norm. Then its residual derivative is , including the term.
Facts & Assumptions
Given: Countable Choice; the real Gelfand triple with separable and its energy space; the stated bounded, coercive, measurable form; bounded linear ; fixed initial and desired data; and .
Countable Choice is the stated axiom for parabolic solvability and Hilbert-space Riesz representation (The Axiom of Countable Choice (), Riesz representation for Hilbert spaces).
On the stated separable real evolution triple, for every right-hand side in and initial trace in , the parabolic equation has a unique energy solution in (Well-posedness for measurable coercive parabolic forms).
Elements of have continuous traces, and for the energy pairing obeys integration by parts, including the endpoint terms (Evolution triples and the parabolic energy space, The evolution-space energy identity and continuous H trace).
Time reversal preserves measurability, boundedness, and coercivity for the transposed form; applying [F1] to the reversed equation gives the terminal adjoint.
Apply Closed pointwise box of L2 controls to the bounded measurable space-time domain . It supplies the pointwise box and the real Hilbert structure on under Countable Choice, so Hilbert-space Riesz representation defines .
For the stated separable , if and in operator norm, then and the parabolic residual contains (Time derivatives of fixed and differentiable comparison projections, Semidiscrete Ritz error splitting and energy estimate).
Proof
For a direction , the state difference satisfies and . By [A1, F1] and linearity, for a bounded linear solution map . Expanding the two squared norms gives The last two terms are quadratic in , so the first two terms give the Fr'echet derivative once the observation residual is paired with .
Set and reverse time: with , , , and , the backward equation becomes the forward equation with initial value . The transposed reversed form is measurable, bounded, and coercive with the same constants, so [A1, F1] supplies its unique energy solution; reflecting back proves [F3] and gives . Its weak equation is . By the energy integration-by-parts identity [F2], testing with the state variation and using and gives Therefore the linear term in step 1.1 is , and the derivative is .
Boundedness of makes the remainder in step 1.1 bounded by , which is . Therefore the derivative is Fr'echet; Riesz representation in [A1] gives the stated gradient.
In the additional finite-element setting of [F5], differentiate in the weak time sense. The product rule gives . Thus the comparison residual contains the full displayed derivative, including ; the reduced-gradient formula does not authorize dropping it.
Remarks
The proof uses the terminal condition on and the zero initial value of a state variation; omitting either endpoint term would invalidate the adjoint identity.
A certified projected-gradient residual bounds distance to the control-mesh optimum
Statement
Assume Countable Choice. Let be a finite-dimensional cellwise-constant control space with nonempty box , and restrict the exact reduced objective of Linear coercive elliptic PDE control problem and reduced objective to . Let be its minimizer and let , where is the linear part of the continuous state-to-observation map and . Assume the residual- and projection-evaluation routines satisfy the finite-return admissibility conditions in Finite-budget projected-gradient loop with state-adjoint residual certificates. Then that finite-budget algorithm terminates in finite time after at most iterations and at most calls to each routine, returning \texttt{inconclusive}, \texttt{budget-exhausted}, or \texttt{certified}. Every \texttt{certified} return at with reported bound satisfies , and consequently . This bounds distance to the control-mesh minimizer of the exact PDE objective; it is not an error estimate between that minimizer and the unrestricted PDE optimum.
Facts & Assumptions
Given: Countable Choice; a nonempty finite-dimensional cellwise-constant box ; the exact reduced objective; ; a valid ; and residual- and projection-evaluation routines satisfying the finite-return admissibility conditions in the algorithm definition.
The FE state and adjoint residuals give (State and adjoint Strang bounds give a reduced-gradient error certificate).
The projection onto the cellwise box clips cell averages and is nonexpansive (The L2 projection onto a cellwise constant box clips cell averages).
The exact reduced objective has gradient and Hessian (Reduced gradient and coercive Hessian for linear elliptic tracking control).
The Hessian bound in [F3] implies -strong convexity of (Reduced gradient and coercive Hessian for linear elliptic tracking control).
A continuous function on a compact finite-dimensional box attains its minimum (Semicontinuous extreme value theorem on compact Euclidean sets).
A self-adjoint endomorphism of a finite-dimensional real-inner-product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).
The algorithm issues \texttt{certified} only when the computed residual plus the adjoint-gradient error bound is at most (Finite-budget projected-gradient loop with state-adjoint residual certificates).
The algorithm performs at most iterations; its admissible residual and projection routines each return in finite time with either their exact valid outputs or failure, and the definition returns the stated failure or exhaustion status when certification does not succeed (Finite-budget projected-gradient loop with state-adjoint residual certificates).
The algorithm supplies a certified bound (Finite-budget projected-gradient loop with state-adjoint residual certificates).
The algorithm sets (Finite-budget projected-gradient loop with state-adjoint residual certificates).
Countable Choice is used through the state-adjoint well-posedness and Hilbert-space Riesz results in [F1] and [F3] (The Axiom of Countable Choice ()).
Proof
Put , , and . By [F1], [A2], and [A3], . Nonexpansiveness [F2] gives . Since , the triangle inequality gives .
Let be the orthogonal projection onto cellwise constants. The clipped-cell-average formula [F2] gives . For , [F3] yields , so applying gives , where . Its Rayleigh quotients lie in ; [F6] therefore implies . Nonexpansiveness now gives .
Since is a nonempty compact box in finite-dimensional , [F5] gives a minimizer, and -strong convexity [F4] makes it unique. For any , the feasible segment from to and differentiability imply . Set . Then . Thus is the unique nearest point in to , so .
By [F7], a \texttt{certified} return is issued only when , so step 1.1 proves the reported bound for the exact mapping residual. By [F8], each residual and projection call returns in finite time, and each is called at most times; the projection routine supplies the exact cell values and step norm used in step 1.1, and all remaining steps are finite scalar arithmetic and comparisons, so the algorithm terminates with one of its stated statuses.
For , steps 1.2–1.3 and the triangle inequality imply . Rearranging yields .
On a \texttt{certified} return, step 1.1 gives ; substituting into step 2.2 proves both displayed distance bounds.
Remarks
The objective in this theorem uses the exact continuous PDE state map and optimizes only over the finite-dimensional control box. Its finite-element state/adjoint solves are gradient approximations certified by the full Strang ledger in State and adjoint Strang bounds give a reduced-gradient error certificate.
Conditional O(h2) variational control error under H2 regularity and full uniform L2 estimates
Statement
Assume Countable Choice. Let minimize the continuous distributed-control objective of Linear coercive elliptic PDE control problem and reduced objective with , , , and observation . Assume exact affine geometry and conforming P1 Galerkin state and adjoint spaces on a shape-regular mesh family. Let be the affine finite-element state map and define the finite-element reduced objective on by
Let be the associated discrete adjoint. Require adjoint consistency for this same state map and objective, namely
This identity is the condition that the discrete adjoint represents the derivative of the stated objective; it must be checked for any perturbed state, form, or load implementation. Set and , and let minimize over the same infinite-dimensional box (variational control discretization). Assume the actual primal and adjoint problems have uniform regularity and the matching primal and dual interpolation bounds of The h^(r+s) L² rate under primal and dual approximation with . Assume also that the full state and adjoint error bounds, including every Strang form/load defect and the state-error contribution to the adjoint load, satisfy
The displayed uniform state/adjoint estimate is an explicit hypothesis here; a concrete PDE family must verify it from its actual regularity, matching dual approximation, and complete Strang/geometry/quadrature/load ledger. An energy error of order alone does not imply this bound. Then
where is independent of . No such rate is asserted on a domain or coefficient class lacking the stated primal, adjoint, and defect estimates.
Facts & Assumptions
Given: The continuous minimizer and variational inequality; the finite-element reduced objective, its adjoint-consistency identity and its minimizer on ; uniform control bounds; the P1 shape-regular mesh; primal and adjoint regularity; the matching Aubin–Nitsche hypotheses; and the full Strang defect estimates.
The continuous gradient is ; the stated adjoint-consistency identity gives , so . The uniform state/adjoint premise therefore supplies (Reduced gradient and coercive Hessian for linear elliptic tracking control, with the explicit error assumption in the Statement).
The continuous reduced gradient is strongly monotone with constant (Reduced gradient and coercive Hessian for linear elliptic tracking control).
The primal and adjoint errors are uniformly over , including the adjoint-load perturbation caused by the primal state error.
Proof
The adjoint-consistency identity and the continuous gradient formula give . The explicit uniform premise [A1], including the state-error contribution to the adjoint load and every form/load defect, therefore gives The actual , dual-approximation, and defect hypotheses must be used to verify [A1] for the PDE family; this proof does not infer it from an energy estimate of order alone.
Put . Strong monotonicity [F5] gives The continuous variational inequality gives . Since minimizes the differentiable on the convex set , its derivative identity gives along the feasible segment toward . Replacing by costs at most by step 1.1. Thus . If the claim is immediate; otherwise divide by to get .
Remarks
The primal and adjoint assumptions must match the actual operator, boundary, and domain. In particular, a full-adjoint estimate is not inferred on an arbitrary Lipschitz or reentrant polygonal domain, an energy estimate of order does not replace the explicit estimate, and unresolved geometry or quadrature defects cannot be discarded.
[F2] Under the matching primal and dual approximation bounds with , the conforming state error obeys the Aubin–Nitsche estimate with order (The h^(r+s) L² rate under primal and dual approximation, Aubin–Nitsche L² error estimate from adjoint approximation).
[F3] Céa and the shape-regular P1 approximation supply the primal rate used in [F2] (Céa quasi-optimality for coercive conforming Galerkin problems, Primal H¹ approximation on shape-regular affine finite-element meshes).
[F4] The Strang estimate retains every form and load defect for perturbed state and adjoint solves (First Strang estimate for conforming perturbed Galerkin problems).
Finite-budget active-set SQP with a certified KKT-system residual status
Definition
Let a finite-dimensional reduced FE control program have a fixed list of inequality constraints. Its exact objective, constraint, gradient, and Hessian evaluators, and its active-row rank and reduced-curvature checks, must terminate on every query or return failure. For each active set , use the active KKT map and exact-Hessian Jacobian specified by Full-step exact-Hessian SQP after active-set identification, with inactive inequality multipliers set to zero. Given an initial primal vector , equality multiplier , and full inequality multiplier vector with entries outside zero when , an ordered finite list of proposed active sets , maximum budget , residual tolerance , a terminating exact-storage routine satisfying the input contract of Finite-precision reduced-QR KKT solve with certified residual status, and its floating-point hypotheses, process at most candidates. If , return inconclusive immediately. At candidate , first set for , then let be the active KKT variable.
-
Evaluate and . Write for the stacked equality and active-inequality rows, and for the Lagrangian Hessian block. Verify that has full row rank and for every nonzero , as required by Finite-precision reduced-QR KKT solve with certified residual status. If an evaluation fails or either condition is false or cannot be verified, mark this candidate
numerical-failure, set , and continue to the next candidate. -
Otherwise set and call Finite-precision reduced-QR KKT solve with certified residual status exactly once on the intended system , supplying the terminating exact-storage routine. Before factorization or residual evaluation, that call must verify that the stored entries equal the intended . An unavailable or unverified admission is a failed QR solve with no residual certificate. On a failed QR solve, record
numerical-failure, set , and continue. -
On a successful QR return, write its vector as and let be its residual bound. Set , , and, for each inequality index , set if and otherwise. Thus the next candidate has a full, dimensionally fixed multiplier vector; newly active multipliers start at zero. The QR vector is the only step used by this wrapper. If , return , where ; otherwise continue.
For each successful solve, retain the tuple with the smallest computed . If the finite list or budget is exhausted, return budget-exhausted with that tuple, or inconclusive if no solve succeeded. The active-kkt-residual-certified status concerns only the linearized active KKT equation residual . A nonlinear next-point KKT residual, box feasibility, multiplier signs, global optimality, and forward accuracy require separate validated checks; none follows from a small linear-system residual alone.
Remarks
For an exact quadratic reduced objective and affine active constraints, including every equality constraint, is affine and its Jacobian is constant, so the next-point active KKT residual equals the linear solve residual in the algorithm. For a nonlinear active KKT map, a certified step-equation residual is not by itself a certificate for ; the local OPT6 convergence theorem additionally requires identified active set, LICQ, strict complementarity, positive reduced curvature, locally Lipschitz Jacobian, and a sufficiently close start. The exact-Hessian algorithm supplies the map/Jacobian convention; the QR algorithm supplies the rank and curvature input conditions. The exact solve is not run by this finite-precision wrapper.
Finite SQP status is sound and the exact local branch inherits OPT6 conditions
Statement
Every active-kkt-residual-certified return of Finite-budget active-set SQP with a certified KKT-system residual status with reported bound satisfies the exact active linear solve residual bound . For a quadratic FE reduced objective with affine equality constraints and affine active inequalities, in particular a program constrained only by a box, this also bounds the exact active KKT residual of the returned next point. On a nonlinear reduced problem, if the true active set is identified and the OPT6 hypotheses hold, exact-arithmetic full steps started sufficiently close converge quadratically to the active KKT pair. The finite-precision residual bound alone does not imply forward error, box optimality, or an SQP accuracy rate.
Facts & Assumptions
Given: A returned finite-budget status and its active set, computed residual upper bound, and, for the separate local convergence statement, a nonlinear program satisfying the stated OPT6 conditions.
The finite algorithm returns the finite-precision QR vector as its step and reports active-kkt-residual-certified only after checking ; it does not label box feasibility or global optimality (Finite-budget active-set SQP with a certified KKT-system residual status).
The OPT6 QR certificate bounds the exact residual of its active KKT linear system; the corresponding solution error additionally depends on (The computed KKT residual certificate bounds the exact linear-system residual).
The exact Hessian/local branch has quadratic convergence under identified active set, LICQ, strict complementarity, positive reduced curvature, locally Lipschitz Jacobian, and a sufficiently close start (Exact-Hessian SQP converges quadratically on the identified active KKT system).
The QR residual certificate’s floating-point assumptions and no-overflow checks hold on any returned certified branch.
Proof
By [F1], a certified return contains a computed linear solve residual bound . Applying [F2] gives the exact inequality . The theorem supplies no smaller bound unless the reported is smaller.
Write the quadratic objective as with symmetric , and stack all equalities and active inequalities as . With their stacked multiplier , the algorithm's convention gives and . Thus is affine in the combined primal-dual variable and . Step 1.1 therefore bounds the returned point's active KKT residual. Affine box inequalities alone do not give this identity when an equality constraint is nonlinear.
In the separate exact local branch, the hypotheses listed in [F3] imply the active KKT Jacobian is nonsingular and locally Lipschitz. The cited OPT6 Newton theorem then applies to the exact full-step active-system iteration started sufficiently near its root and gives quadratic convergence. This conclusion is conditional on those hypotheses and is independent of finite-budget status.
Remarks
The exact local convergence conclusion remains conditional on the OPT6 hypotheses and is independent of this finite-budget residual status. No exact-solve status implies a small forward error without a bound on the inverse active KKT matrix.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Eduardo Casas and Fredi Tröltzsch, Error estimates for linear-quadratic elliptic control problems
- Hannes Meinlschmidt, Optimization with Partial Differential Equations, FAU lecture notes
- Michael Hinze, A Variational Discretization Concept in Control Constrained Optimization
- Christian Clason, Introduction to Finite Element Methods, lecture notes
- Jorge Nocedal and Stephen J. Wright, Numerical Optimization, 2nd ed.