Back to Results
First PageMeta Content
Numerical analysis / Linear programming / Interior point method / Duality gap / Duality / Karush–Kuhn–Tucker conditions / Simplex algorithm / Semidefinite programming / Quadratic programming / Mathematical optimization / Operations research / Convex optimization


Primal-Dual Interior Point algorithms for Linear Programming George Tzallas-Regas Interior point methods were widely used in the past in the form of barrier methods. In linear programming, the simplex method dominated, m
Add to Reading List

Document Date: 2010-09-22 12:28:52

Open Document

File Size: 97,67 KB

Share Result on Facebook

City

Philadelphia / Belmont / /

Country

United States / /

IndustryTerm

primal-dual solutions / polynomial-time algorithm / search directions / complementarity products / line search parameter / search direction / primal-dual solution / applicable fot systems / /

Organization

Society for Industrial and Applied Mathematics / /

Person

Richard A. Tapia / Margaret H. Wright / Dimitri P. Bertsekas / George Tzallas-Regas / T. Tsuchiya / Yin Zhang / A. S. El-Bakry / /

Position

General / /

ProvinceOrState

Massachusetts / /

Technology

Primal-Dual Interior Point algorithms / polynomial-time algorithm / 6 Primal-Dual Interior Point Algorithm / /

URL

ftp /

SocialTag