학술논문
A faster method for computing Karmarkar's projections for large number of constraints.
Document Type
Journal
Author
Spedicato, E. (I-BERG) AMS Author Profile; Nicolai, S. (I-BERG) AMS Author Profile; Yang, Z. (PRC-DUT-AM) AMS Author Profile
Source
Subject
65 Numerical analysis -- 65F Numerical linear algebra
65F30Other matrix algorithms
90Operations research, mathematical programming -- 90C Mathematical programming
90C08Special problems of linear programming
65F30
90
90C08
Language
English
Abstract
Summary: ``In this paper we consider solving the linear system $AD^2_iA^\ssf Ty=AD^2_ic$, where $A$ is an $m\times n$ full row rank matrix, $m\leq n$, $y\in \bold R^m$, $c\in \bold R^n$, $D_i$ is diagonal with positive elements. Such a system characterizes the iteration of interior point methods and several problems in linear regression. We show that an equivalent system can be considered that has $n-m$ equations and variables, resulting in a significant reduction of the solution cost for large values of $m$.''