Mathematics – Optimization and Control
Scientific paper
2001-03-15
Mathematics
Optimization and Control
42 pages
Scientific paper
We show that the effects of finite-precision arithmetic in forming and solving the linear system that arises at each iteration of primal-dual interior-point algorithms for nonlinear programming are benign, provided that the iterates satisfy centrality and feasibility conditions of the type usually associated with path-following methods. When we replace the standard assumption that the active constraint gradients are independent by the weaker Mangasarian-Fromovitz constraint qualification, rapid convergence usually is attainable, even when cancellation and roundoff errors occur during the calculations. In deriving our main results, we prove a key technical result about the size of the exact primal-dual step. This result can be used to modify existing analysis of primal-dual interior-point methods for convex programming, making it possible to extend the superlinear local convergence results to the nonconvex case.
No associations
LandOfFree
Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-638803