Effects of finite-precision arithmetic on interior-point methods for nonlinear programming

SIAM Journal on Optimization

Volumn 12, Issue 1, 2002, Pages 36-78

  Wright, Stephen J ^a  

^a ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Constraint qualification; Finite precision arithmetic; Nonlinear programming; Primal dual interior point algorithms

Indexed keywords

EID: 0036342085     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498347438     Document Type: Article

References (31)

1. Implementation of interior-point methods for large scale linear programming
2. Some stable methods for calculating inertia and solving symmetric linear systems
3. Direct methods for solving symmetric indefinite systems of linear equations
4. PCx: An interior-point code for linear programming
5. Definite and semidefinite quadratic forms
6. The factorization of sparse symmetric indefinite matrices
7. On convergence rate of newton interior-point algorithms in the absence of strict complementarity
8. Stability of symmetric ill-conditioned systems arising in interior methods for constrained optimization
9. Solving symmetric indefinite systems in an interior-point method for linear programming
10. A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
11. On the accurate determination of search directions for simple differentiable penalty functions
12. Stabilized sequential quadratic programming
13. Accuracy and Stability of Numerical Algorithms
14. Stability of the diagonal pivoting method with partial pivoting
15. The Fritz-John necessary optimality conditions in the presence of equality and inequality constraints
16. On the implementation of a primal-dual interior point method
17. Local convergence of interior-point algorithms for degenerate monotone LCP
18. Superlinear convergence of an interior-point method for monotone variational inequalities
19. Superlinear convergence of an interior-point method despite dependent constraints
20. Ill-conditioning and computational error in interior methods for nonlinear programming
21. Stability of linear equations solvers in interior-point methods
22. Primal-Dual Interior-Point Methods
23. Stability of augmented system factorizations in interior-point methods
24. Superlinear convergence of a stabilized SQP method to a degenerate solution
25. Modified Cholesky factorizations in interior-point algorithms for linear programming
26. A superlinear infeasible-interior-point algorithm for monotone nonlinear complementarity problems