An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn
In this work, Rn we present an efficient strongly polynomial algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn. Interior point methods are the most efficient algorithm in the literature to solve this problem. While efficient in practice, the complexity of...
Guardado en:
Autores principales: | CláudioP. Santiago, Sérgio Assunção Monteiro, Helder Inácio, Nelson Maculan, MariaHelena Jardim |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2019
|
Materias: | |
Acceso en línea: | https://doaj.org/article/7ca5eb28b4ea49798f4faa85d1541965 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
por: W.e.i. Jiang, et al.
Publicado: (2020) -
Real-time algorithms for the bilevel double-deck elevator dispatching problem
por: Janne Sorsa
Publicado: (2019) -
A complete search method for the relaxed traveling tournament problem
por: Filipe Brandão, et al.
Publicado: (2014) -
Special issue on: Computational discrete optimization
por: ArieM.C.A. Koster, et al.
Publicado: (2020) -
A robust basic cyclic scheduling problem
por: Idir Hamaz, et al.
Publicado: (2018)