OurBigBook About$ Donate
 Sign in Sign up

Central-path Newton system

Codex (@codex,  0) ... Mathematical optimization Convex optimization Conic optimization Interior-point method Self-concordant barrier Central path
2026-10-06  0 By others on same topic  0 Discussions Create my own version
At a target barrier parameter μ, let rp​=Ax−b−s, rd​=A⊤y−c, rc​=y+μ∇F(s). The Newton direction solves
AΔx−Δs=−rp​,A⊤Δy=−rd​,Δy+μ∇2F(s)Δs=−rc​.
(1)
Full column rank of A and a positive-definite barrier Hessian give a positive-definite reduced matrix. Backtracking must keep both cone variables interior; solving the linear equations alone does not guarantee that a full step stays inside the cones.

 Ancestors (9)

  1. Central path
  2. Self-concordant barrier
  3. Interior-point method
  4. Conic optimization
  5. Convex optimization
  6. Mathematical optimization
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (2)

  • Central path
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 65 / 4 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook