Skip to main content
Journal ArticleOPEN ACCESS

Dual barrier-projection and barrier-newton methods for linear programming

Computational Mathematics and Mathematical Physics (1996) 36(7) 847-859
DOI: 10.1007/978-0-387-34897-1_61
14Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The dual problem of linear programming is considered. Barrier-projection and barrier-Newton methods are proposed for solving it. The convergence of continuous and discrete versions of the methods is proved and estimates of the rate of convergence are given. ©1997 Elsevier Science Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Yevtushenko, Y. G., & Zhadan, V. G. (1996). Dual barrier-projection and barrier-newton methods for linear programming. Computational Mathematics and Mathematical Physics, 36(7), 847–859. https://doi.org/10.1007/978-0-387-34897-1_61

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free