Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Netlib"'
Publikováno v:
Mathematics; Volume 11; Issue 7; Pages: 1654
The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c981826c71e1aec3714bd7784d6c2a20
Akademický článek
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.
Autor:
Jérémy Omer, Michael Poss
Publikováno v:
Annals of Operations Research
Annals of Operations Research, Springer Verlag, 2021, 304, pp.361-379. ⟨10.1007/s10479-021-04126-9⟩
Annals of Operations Research, 2021, 304 (1-2), pp.361-379. ⟨10.1007/s10479-021-04126-9⟩
Annals of Operations Research, Springer Verlag, 2021, 304, pp.361-379. ⟨10.1007/s10479-021-04126-9⟩
Annals of Operations Research, 2021, 304 (1-2), pp.361-379. ⟨10.1007/s10479-021-04126-9⟩
International audience; A classical problem in the study of an infeasible system of linear inequalities is to determine irreducible infeasible subsystems of inequalities (IISs), i.e., infeasible subsets of inequalities whose proper subsets are feasib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38482940b11e36aec8eef719967faa05
https://doi.org/10.1007/s10479-021-04126-9
https://doi.org/10.1007/s10479-021-04126-9
Publikováno v:
Mathematical Programming Computation. 13:491-508
The computation of an initial basis is of great importance for simplex algorithms since it determines to a large extent the number of iterations and the computational effort needed to solve linear programs. We propose three algorithms that aim to con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30b80b3d6a62ebd75e72e7bc896bfe10
https://doi.org/10.1007/s12532-020-00188-1
https://doi.org/10.1007/s12532-020-00188-1
Publikováno v:
SIAM Journal on Numerical Analysis, 2007 Jan 01. 46(1), 180-200.
Externí odkaz:
https://www.jstor.org/stable/40233333
Publikováno v:
Mathematics, Vol 8, Iss 3, p 356 (2020)
Mathematics
Volume 8
Issue 3
Mathematics
Volume 8
Issue 3
An enthusiastic artificial-free linear programming method based on a sequence of jumps and the simplex method is proposed in this paper. It performs in three phases. Starting with phase 1, it guarantees the existence of a feasible point by relaxing a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd87e7e4ef4803c821f74105b1e02895
https://www.mdpi.com/2227-7390/8/3/356
https://www.mdpi.com/2227-7390/8/3/356
Bloch wavefunctions in solids form a representation of crystalline symmetries. Recent studies revealed that symmetry representations in band structure can be used to diagnose the topological properties of weakly interacting materials. In this work, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6059524a88087602cbe7a8c870c7843
Autor:
Behrouz Kheirfam, Masoumeh Haghighi
Publikováno v:
Periodica Mathematica Hungarica. 79:94-105
This paper presents an interior point algorithm for solving linear optimization problems in a wide neighborhood of the central path introduced by Ai and Zhang (SIAM J Optim 16:400–417, 2005). In each iteration, the algorithm computes the new search
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65037328894483b24b5ce076038ca66d
https://doi.org/10.1007/s10998-018-00271-0
https://doi.org/10.1007/s10998-018-00271-0
Publikováno v:
Optimization Methods and Software. 34:336-362
In this paper, we present a feasible predictor–corrector interior-point method for symmetric cone optimization problem in the large neighbourhood of the central path. The method is generalization of Ai-Zhang's predictor–corrector algorithm to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c48dbcc9d01cc06a95f159e2ec14263
https://doi.org/10.1080/10556788.2018.1528248
https://doi.org/10.1080/10556788.2018.1528248
Autor:
Ordóñez, Fernando, Freund, Robert M.
The modern theory of condition measures for convex optimization problems was initially developed for convex problems in conic format, and several aspects of the theory have now been extended to handle non-conic formats as well. In this theory, the (R
Externí odkaz:
http://hdl.handle.net/1721.1/3716