571 research outputs found
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
A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil
The quadratic programming over one inequality quadratic constraint (QP1QC) is
a very special case of quadratically constrained quadratic programming (QCQP)
and attracted much attention since early 1990's. It is now understood that,
under the primal Slater condition, (QP1QC) has a tight SDP relaxation (PSDP).
The optimal solution to (QP1QC), if exists, can be obtained by a matrix rank
one decomposition of the optimal matrix X? to (PSDP). In this paper, we pay a
revisit to (QP1QC) by analyzing the associated matrix pencil of two symmetric
real matrices A and B, the former matrix of which defines the quadratic term of
the objective function whereas the latter for the constraint. We focus on the
\undesired" (QP1QC) problems which are often ignored in typical literature:
either there exists no Slater point, or (QP1QC) is unbounded below, or (QP1QC)
is bounded below but unattainable. Our analysis is conducted with the help of
the matrix pencil, not only for checking whether the undesired cases do happen,
but also for an alternative way to compute the optimal solution in comparison
with the usual SDP/rank-one-decomposition procedure.Comment: 22 pages, 0 figure
- ā¦