Zobrazeno 1 - 10
of 493
pro vyhledávání: '"Revised simplex method"'
Publikováno v:
IEEE Access, Vol 8, Pp 52121-52138 (2020)
Optimization problems lie at the core of scientific and engineering endeavors. Solutions to these problems are often compute-intensive. To fulfill their compute-resource requirements, graphics processing unit (GPU) technology is considered a great op
Externí odkaz:
https://doaj.org/article/7c445be4c0d64f7484840d9bb8d38435
Autor:
Ploskas Nikolaos, Samaras Nikolaos
Publikováno v:
Yugoslav Journal of Operations Research, Vol 24, Iss 3, Pp 321-332 (2014)
Pricing is a significant step in the simplex algorithm where an improving nonbasic variable is selected in order to enter the basis. This step is crucial and can dictate the total execution time. In this paper, we perform a computational study in
Externí odkaz:
https://doaj.org/article/9ed9cae0dc774f4ab042ea0b9550e940
Autor:
Lukas Schork, Jacek Gondzio
Publikováno v:
Schork, L & Gondzio, J 2020, ' Implementation of an Interior Point Method with Basis Preconditioning ', Mathematical Programming Computation, vol. 12, pp. 603–635 . https://doi.org/10.1007/s12532-020-00181-8
The implementation of a linear programming interior point solver is described that is based on iterative linear algebra. The linear systems are preconditioned by a basis matrix, which is updated from one interior point iteration to the next to bound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54ea81f18ddc742360d231645b25e1f3
https://doi.org/10.1007/s12532-020-00181-8
https://doi.org/10.1007/s12532-020-00181-8
Publikováno v:
IEEE Access, Vol 8, Pp 52121-52138 (2020)
Optimization problems lie at the core of scientific and engineering endeavors. Solutions to these problems are often compute-intensive. To fulfill their compute-resource requirements, graphics processing unit (GPU) technology is considered a great op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f72a07d5faf975aef42bf567669ca96d
http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-77314
http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-77314
Publikováno v:
Scopus-Elsevier
This paper considers the primal quadratic simplex method for linearly constrained convex quadratic programming problems. Finiteness of the algorithm is proven when $${\mathbf {s}}$$ -monotone index selection rules are applied. The proof is rather gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11ff993986230ad8fbfb515949804926
https://doi.org/10.1007/s10100-018-0523-1
https://doi.org/10.1007/s10100-018-0523-1
Autor:
J. A. J. Hall, Qi Huangfu
Publikováno v:
Huangfu, Q & Hall, J 2018, ' Parallelizing the dual revised simplex method ', Mathematical Programming Computation, vol. 10, no. 1, pp. 119-142 . https://doi.org/10.1007/s12532-017-0130-5
This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear programming problems. One approach, called PAMI, extends a relatively unknown pivoting strategy called suboptimization and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f1175848728e30889a5c33b9135b387
https://doi.org/10.1007/s12532-017-0130-5
https://doi.org/10.1007/s12532-017-0130-5
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Statistical Computation and Simulation. 87:3521-3536
A vector of k positive coordinates lies in the k-dimensional simplex when the sum of all coordinates in the vector is constrained to equal 1. Sampling distributions efficiently on the simplex can be difficult because of this constraint. This paper in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03246db1876567684afba69f6a5ea4fa
https://doi.org/10.1080/00949655.2017.1376063
https://doi.org/10.1080/00949655.2017.1376063
Autor:
Rahidas Kumar, Sahdeo Mahto
Publikováno v:
International Journal of Mathematics Trends and Technology. 47:1-4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddd65b13a88c3520a6e90a03dd4d1499
https://doi.org/10.14445/22315373/ijmtt-v47p501
https://doi.org/10.14445/22315373/ijmtt-v47p501
Publikováno v:
Tsinghua Science and Technology. 22:73-82
This paper works on a modified simplex algorithm for the local optimization of Continuous PieceWise Linear (CPWL) programming with generalization of hinging hyperplane objective and linear constraints. CPWL programming is popular since it can be equi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7e1599b3c01d0c036c3682d76a2a441
https://doi.org/10.1109/tst.2017.7830897
https://doi.org/10.1109/tst.2017.7830897