Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Infeasible interior-point method"”.

  1. Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems

    In this thesis, we present an improved version of Infeasible Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each …

    gsu Repository record for Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems (opens in a new tab)

  2. Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

    <p>In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters …

    gsu Repository record for Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems (opens in a new tab)

  3. Interior-point methods for linear and mixed complementarity problems

    An infeasible interior-point method with backtracking line search is proposed to solve the linear complementarity and the general mixed complementarity problem. The standard nonlinear complementarity problem is a special case of the latter problem. The algorithm is based on a method for the general …

    greece Repository record for Interior-point methods for linear and mixed complementarity problems (opens in a new tab)