Interior-Point Methods in Parallel Computation
نویسندگان
چکیده
In this paper we use interior-point methods for linear programming, developed in t,he contest of sequential computation, to obtain a parallel algorithm for t,he bipartite matching problem. Our algorithm runs in 0*(,/E) time I. Our results extend to the weighted bipartite matching problem and to the zero-one minimum-cost flow problem, yielding O*( filog C’) algorithms?. This improvk’previous bounds on these problems and illustrates the importance of interior-point methods in t#he contest of parallel algorithm design.
منابع مشابه
Parallel Primal-dual Interior-point Methods for Semidefinite Programs B-415 Parallel Primal-dual Interior-point Methods for Semidefinite Programs
The Semidefinite Program (SDP) is a fundamental problem in mathematical programming. It covers a wide range of applications, such as combinatorial optimization, control theory, polynomial optimization, and quantum chemistry. Solving extremely large-scale SDPs which could not be solved before is a significant work to open up a new vista of future applications of SDPs. Our two software packages S...
متن کاملUsing Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
In this paper we use interior-point methods for linear programming, developed in the context of sequential computation, to obtain a parallel algorithm for the bipartite matching problem. Our algorithm nds a maximum cardinality matching in a bipartite graph with n nodes and m edges in O(pm log3 n) time on a CRCW PRAM. Our results extend to the weighted bipartite matching problem and to the zero-...
متن کاملA parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion
A parallel computational method SDPARA-C is presented for SDPs (semidefinite programs). It combines two methods SDPARA and SDPA-C proposed by the authors who developed a software package SDPA. SDPARA is a parallel implementation of SDPA and it features parallel computation of the elements of the Schur complement equation system and a parallel Cholesky factorization of its coefficient matrix. SD...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملA full Nesterov-Todd step interior-point method for circular cone optimization
In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.
متن کامل