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.
Log-barrier central paths and primal-dual Newton residuals
Definition
For a inequality problem with the convention of Inequality constrained programs, tangent cones, constraint qualifications, and KKT, let be open and convex, let be convex functions on , and let and . Assume there exists with and for every . For , its log-barrier objective is Any attained minimizer is a central point. Its central multipliers are . A central point and multiplier tuple satisfy , , and for an equality multiplier .
For the conic model of Conic, LP, and convex QP primal-dual models, let and let be a self-concordant barrier on . The conic barrier objective is restricted to . An attained minimizer satisfies for some . Its barrier multiplier is .
For a standard-form LP or convex QP with , , , and objective ( for an LP), define the primal-dual residuals where , , , and . For , the modified KKT Newton direction solves
For orthant, Lorentz, or positive-semidefinite cone factors, define the diagnostic conic residuals as , , and . These factors are self-dual under their standard Euclidean or trace pairings by The orthant logarithmic barrier has parameter equal to its dimension, The Lorentz logarithmic barrier has parameter two, and The positive semidefinite cone is self-dual and its log determinant barrier has parameter n, so and occupy the same factor spaces. For the orthant, is coordinatewise multiplication and . The Lorentz Jordan product is with ; for symmetric matrices with . In each factor, pairing with gives : this is the coordinate sum for the orthant, the first coordinate for the Lorentz product, and for symmetric matrices by the finite-index trace identity. In each product cone, , where is the sum of the factor barrier parameters. This Jordan target is a diagnostic convention, not in general the centered residual for the selected barrier : for a Lorentz factor , , whereas the orthant and log-determinant barriers give . Thus their barrier multipliers have factor targets and , respectively, although the product gap gives . No equivalence between and that barrier central path is asserted. When forming a Newton direction for this diagnostic target, hold fixed. The linearized slack is .
Residual tolerances describe a candidate unless an independent argument also verifies feasibility and a primal-dual gap. A finite iteration or factorization budget that returns a candidate, failure, or inconclusive status is not itself an optimality certificate.
Depends on
- Self-concordant log-homogeneous barriers and their local geometry
- Conic, LP, and convex QP primal-dual models
- Inequality constrained programs, tangent cones, constraint qualifications, and KKT
- The orthant logarithmic barrier has parameter equal to its dimension
- The Lorentz logarithmic barrier has parameter two
- The positive semidefinite cone is self-dual and its log determinant barrier has parameter n
Used by
- Finite-budget primal-dual Newton methods for LP, convex QP, and symmetric cones Algorithm
- Short-step self-concordant path following with finite failure statuses Algorithm
- A central path approaches the boundary and the Hessian conditioning diverges Example
- A two-resource allocation LP and its central path Example
- The LP/QP primal-dual Newton matrix is nonsingular from a strict positive start Lemma
- A verified inexact gradient residual bounds central-path distance and objective error Theorem
- Exact central points have barrier gap m/t or nu/t Theorem
Dependency tree · two levels
17 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
- Stephen Boyd and Lieven Vandenberghe, Convex Optimization (standard reference, not scraped)
- Hamza Fawzi, Topics in Convex Optimisation, Lectures 15–16 (standard reference, not scraped)