(Enter summary)
Abstract: . In this work we devise efficient algorithms for finding the search directions for interior
point methods applied to linear programming problems. There are two innovations. The first is the
use of updating of preconditioners computed for previous barrier parameters. The second is an
adaptive automated procedure for determining whether to use a direct or iterative solver, whether
to reinitialize or update the preconditioner, and how many updates to apply. These decisions are
based on... (Update)
Context of citations to this paper: More
.... interior point iterations is globally convergent if the norm of (r k ; r k ) is bounded as in (32) Hence the class of preconditioners in [1, 16] can be applied in the implementation of a mixed interior point algorithm, and still maintain global convergence. For u 2 m , v 2...
.... Moreover, a combination of a direct method and an iterative method was reported by Karmarkar and Ramakrishnan [18] Wang and O Leary [24] propose a strategy of preconditioning the normal equation system based on low rank corrections, and in their implementation the index set...
Cited by: More
Memory Hierarchy Optimizations and Performance Bounds.. - Vuduc, Gyulassy.. (2003)
(Correct)
Memory Hierarchy Optimizations and Performance Bounds .. - Vuduc, Gyulassy.. (2003)
(Correct)
Application of a New Class of Preconditioners to.. - Baryamureeba, Steihaug
(Correct)
Similar documents (at the sentence level):
40.2%: Adaptive Use of Iterative Methods in Predictor-Corrector.. - Wang, O'Leary (1999)
(Correct)
Active bibliography (related documents): More All
0.7: Symbiosis between Linear Algebra and Optimization - O'Leary (1999)
(Correct)
0.4: Final Iterations in Interior Point Methods - Preconditioned.. - Wang (1996)
(Correct)
0.3: Computational Issues for a New Class of Preconditioners - Baryamureeba, Steihaug (1999)
(Correct)
Similar documents based on text: More All
0.3: Preconditioning Reduced Matrices - Nash, Sofer (1996)
(Correct)
0.2: International Conference on Engineering Education.. - Successful Exemplary.. (2001)
(Correct)
0.1: Delinquency and Homelessness: Towards an Integrated Response - Podesta, Jones
(Correct)
Related documents from co-citation: More All
7: Electronic mail distribution of linear programming test problems (context) - Gay - 1985
6: Inexact Newton methods (context) - Dembo, Eisenstat et al. - 1982
5: Computational issues for a new class of preconditioners
- Baryamureeba, Steihaug - 1999
BibTeX entry: (Update)
W. Wang and D. P. O'Leary, Adaptive use of iterative methods in interior point methods for linear programming, Tech. Rep. CS-TR-3560, Department of Computer Science, University of Maryland, College Park, Maryland, 1995. http://citeseer.ist.psu.edu/wang95adaptive.html More
@techreport{ wang95adaptive,
author = "Weichung Wang and Dianne P. O'Leary",
title = "Adaptive Use of Iterative Methods in Interior Point Methods for Linear Programming",
number = "CS-TR-3560",
year = "1995",
url = "citeseer.ist.psu.edu/wang95adaptive.html" }
Citations (may not include all citations):
663
Practical Optimization (context) - Gill, Murray et al. - 1981
448
A new polynomial-time algorithm for linear programming (context) - Karmarkar - 1984 ACM DBLP
322
Direct Methods for Sparse Matrices (context) - Duff, Erisman et al. - 1986 ACM
258
Golub and Charles F (context) - Gene - 1989
180
LINPACK User's Guide (context) - Dongarra, Bunch et al. - 1979
165
SPARSKIT : A Basic Tool Kit for Sparse Matrix Computations
- Saad - 1994
104
LSQR : An algorithm for sparse linear equations and sparse l.. (context) - Paige, Saunders - 1982
94
LOQO : An interior point code for quadratic programming
- Vanderbei - 1995
92
Electronic mail distribution of linear programming test prob.. (context) - Gay - 1985
85
Path-following methods for linear programming (context) - Gonzaga - 1992 ACM
74
Modification of the minimum-degree algorithm by multiple eli.. (context) - Liu - 1985 ACM DBLP
68
Interior point methods for linear programming: Computational.. (context) - Lustig, Marsten et al. - 1994
64
Interior methods for constrained optimization
- Wright - 1992
62
Computationalexperiencewith a primaldual interior point meth.. (context) - Lustig, Marsten et al. - 1991
34
On projected Newton barrier methods for linear programming a.. (context) - Gill, Murray et al. - 1986
33
Algorithms for network programming (context) - Kennington, Helgason - 1980 ACM
29
Computational results of an interior point algorithm for lar.. (context) - Karmarkar, Ramakrishnan - 1991 ACM
26
Newton-type methods for unconstrained and linearly constrain.. (context) - Gill, Murray - 1974
19
Implementation of affine scaling methods: Approximate soluti.. (context) - Mehrotra - 1992
17
A QMR-based interior-point algorithm for solving linear prog..
- Freund, Jarre - 1995 ACM
17
NETGEN: A program for generating large scale capacitated ass.. (context) - Klingman, Napier et al. - 1974
11
An empirical evaluation of the KORBX algorithms for military.. (context) - Carolan, Hill et al. - 1990 ACM
11
A truncated primal-infeasible dual-feasible network interior..
- Portugal, Resende et al. - 1994 DBLP
11
An interior point method for quadratic programs based on con.. (context) - Carpenter, Shanno - 1993 ACM
7
Conjugate gradient based implementation of interior point me.. (context) - Mehrotra, Wang - 1995
6
Further development of a primal-dual interior point method (context) - Choi, Monma et al. - 1990
3
A relaxed version of Karmarkar's method (context) - Goldfarb, Mehrotra - 1988
3
Iterative methods for the augmented equations in large-scale.. (context) - Chin, Vannelli - 1994
3
Cholesky factor updating techniques for rank 2 matrix modifi.. (context) - Bartels, Kaufman - 1989 ACM
2
Computational methods for an LP model of the placement probl.. (context) - Chin, Vannelli - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umd.edu/TRs/TR-no-abs.html): More
Iterative Methods For Stabilized Discrete Convection-Diffusion.. - Shih, Elman (1998)
(Correct)
Perturbation Theory for the Singular Value Decomposition - Stewart (1990)
(Correct)
Adaptive Runtime Support for Direct Simulation Monte Carlo.. - Moon, Saltz (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC