Search Results - "polynomial complexity"

  • Showing 1 - 2 results of 2
Refine Results
  1. 1
    A full-Newton step feasible interior-point algorithm for P*(k)-linear complementarity problems

    A full-Newton step feasible interior-point algorithm for P*(k)-linear complementarity problems by Wang, G., Yu, Changjun, Teo, Kok Lay

    Published 2013
    Subjects: “…polynomial complexity…”
    Get full text
  2. 2
    A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization

    A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization by Wang, G., Yu, C., Teo, Kok Lay

    Published 2013
    Subjects: “…polynomial complexity…”
    Get full text

Search Tools: