We may earn an affiliate commission when you visit our partners.

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems

Masakazu Kojima, N. Megiddo, T. Noma, and Akiko Yoshise

Following Karmarkar's 1984 linear programming algorithm, numerous interior-point algorithms have been proposed for various mathematical programming problems such as linear programming, convex quadratic programming and convex programming in ...

Read this on Amazon

Available editions

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems (Lecture Notes in Computer Science, 538)

Paperback

$$$

Save this book

Save A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems to your list so you can find it easily later:

Save

Help others find this book page by sharing it with your friends and followers:

Facebook

Copy Link

Length: 124 pages

Share and help others discover this book.

Facebook

Link

Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.