Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jerome W. O'Neal"'
Publikováno v:
The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology. 11:265-276
Social network analysis (SNA) is a rapidly growing field with numerous applications in industry and government. However, the field still lacks means to generate random social networks with certain desired properties, thus inhibiting their ability to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57133bdea9be1a372314f06e303e5aa3
https://doi.org/10.1177/1548512912450370
https://doi.org/10.1177/1548512912450370
Publikováno v:
Optimization Methods and Software. 24:123-143
In this paper, we present a long-step infeasible primal-dual path-following algorithm for convex quadratic programming (CQP) whose search directions are computed by means of a preconditioned iterative linear solver. In contrast to the authors' previo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b07e1b9a16c85858247f55bb15af399a
https://doi.org/10.1080/10556780802414049
https://doi.org/10.1080/10556780802414049
Publikováno v:
Interfaces. 37:436-444
Delta Air Lines, Inc., forms alliances with other airlines to expand the network of markets it can serve through a process known as codesharing. Codesharing allows an airline to place its marketing code on an alliance partner's flights. A carrier can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6863b3088c17ae2fb65f8a10e5cb1be0
https://doi.org/10.1287/inte.1070.0301
https://doi.org/10.1287/inte.1070.0301
Publikováno v:
SIAM Journal on Optimization. 17:287-310
In this paper we develop a long-step primal-dual infeasible path-following algorithm for convex quadratic programming (CQP) whose search directions are computed by means of a preconditioned iterative linear solver. We propose a new linear system, whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4772f8575b0fb0f919bf0fb4b5d288bc
https://doi.org/10.1137/04060771x
https://doi.org/10.1137/04060771x
Publikováno v:
SIAM Journal on Optimization. 15:96-100
Solving systems of linear equations with "normal" matrices of the form A D2 AT is a key ingredient in the computation of search directions for interior-point algorithms. In this article, we establish that a well-known basis preconditioner for such sy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b9ee420da05af3bed20a6743c073820
https://doi.org/10.1137/s1052623403426398
https://doi.org/10.1137/s1052623403426398