An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn
Year of publication: |
2019
|
---|---|
Authors: | Santiago, Cláudio P. ; Assunção Monteiro, Sérgio ; Inácio, Helder ; Maculan F., Nelson ; Jardim, Maria Helena |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 7.2019, 2, p. 177-207
|
Subject: | Convex programming | Interior-point methods | Orthogonal projections | Separable quadratic programming | Strongly polynomial algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Projektmanagement | Project management | Algorithmus | Algorithm |
-
A strongly polynomial contraction-expansion algorithm for network flow problems
Gauthier, Jean Bertrand, (2017)
-
A primal-simplex based Tardos' algorithm
Mizuno, Shinji, (2015)
-
Robust capacity planning for project management
Conejo, Antonio J., (2021)
- More ...
-
On deep disjunctive cutting planes for set partitioning : a computationally oriented research
Campello, Ruy Eduardo, (1984)
-
Neamatian Monemi, Rahimeh, (2023)
-
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
Souza, Michael, (2011)
- More ...