An Interior-point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity Problems

Abstract

For linear programming, a primal-dual interior-point algorithm was recently constructed by Zhang and Tapia that achieves both polynomial complexity and Q-superlinear convergence (Q-quadratic in the nondegenerate case). In this pa- per, we extend their results to quadratic programming and linear complementarity problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1991
Accession Number
ADA452257

Entities

People

  • F. Potra
  • Jun Ji
  • Richard A. Tapia
  • Yinglong Zhang

Organizations

  • Rice University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Convergence
  • Evolutionary Algorithms
  • Heuristic Methods
  • Information Operations
  • Linear Programming
  • Mathematics
  • Operations Research
  • Polynomials
  • Quadratic Programming

Fields of Study

  • Mathematics

Readers

  • Operations Research