152 research outputs found
INFEASIBLE FULL NEWTON-STEP INTERIOR-POINT METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS
In this paper we consider an Infeasible Full Newton-step Interior-Point Method (IFNS-IPM) for monotone Linear Complementarity Problems (LCP). The method does not require a strictly feasible starting point. In addition, the method avoids calculation of the step size and instead takes full Newton-steps at each iteration. Iterates are kept close to the central path by suitable choice of parameters. The algorithm is globally convergent and the iteration bound matches the best known iteration bound for these types of methods
Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
In this paper we will discuss two variants of an inexact feasible interior
point algorithm for convex quadratic programming. We will consider two
different neighbourhoods: a (small) one induced by the use of the Euclidean
norm which yields a short-step algorithm and a symmetric one induced by the use
of the infinity norm which yields a (practical) long-step algorithm. Both
algorithms allow for the Newton equation system to be solved inexactly. For
both algorithms we will provide conditions for the level of error acceptable in
the Newton equation and establish the worst-case complexity results
Convergence analysis of an Inexact Infeasible Interior Point method for Semidefinite Programming
In this paper we present an extension to SDP of the well known infeasible Interior Point method for linear programming of Kojima,Megiddo and Mizuno (A primal-dual infeasible-interior-point algorithm for Linear Programming, Math. Progr., 1993). The extension developed here allows the use of inexact search directions; i.e., the linear systems defining the search directions can be solved with an accuracy that increases as the solution is approached. A convergence analysis is carried out and the global convergence of the method is prove
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability. In this paper, we consider PDE-constrained optimization problems with bound constraints on the state and control variables, and their representation on the discrete level as quadratic programming problems. To tackle complex problems and achieve high accuracy in the solution, one is required to solve matrix systems of huge scale resulting from Newton iteration, and hence fast and robust methods for these systems are required. We present preconditioned iterative techniques for solving a number of these problems using Krylov subspace methods, considering in what circumstances one may predict rapid convergence of the solvers in theory, as well as the solutions observed from practical computations
- ā¦