Standard

Randomized heuristic algorithms for orthogonal projection of a point onto a set. / Abbasov, Majid E.; Bure, Vladimir M.

In: Communications in Statistics Part B: Simulation and Computation, Vol. 48, No. 10, 26.11.2019, p. 2866-2876.

Research output: Contribution to journal › Article › peer-review

Harvard

Abbasov, ME & Bure, VM 2019, 'Randomized heuristic algorithms for orthogonal projection of a point onto a set', Communications in Statistics Part B: Simulation and Computation, vol. 48, no. 10, pp. 2866-2876. https://doi.org/10.1080/03610918.2018.1469764

APA

Abbasov, M. E., & Bure, V. M. (2019). Randomized heuristic algorithms for orthogonal projection of a point onto a set. Communications in Statistics Part B: Simulation and Computation, 48(10), 2866-2876. https://doi.org/10.1080/03610918.2018.1469764

Vancouver

Abbasov ME, Bure VM. Randomized heuristic algorithms for orthogonal projection of a point onto a set. Communications in Statistics Part B: Simulation and Computation. 2019 Nov 26;48(10):2866-2876. https://doi.org/10.1080/03610918.2018.1469764

Author

Abbasov, Majid E. ; Bure, Vladimir M. / Randomized heuristic algorithms for orthogonal projection of a point onto a set. In: Communications in Statistics Part B: Simulation and Computation. 2019 ; Vol. 48, No. 10. pp. 2866-2876.

BibTeX

@article{63a04ffffe2541a6afec04f318af632a,
title = "Randomized heuristic algorithms for orthogonal projection of a point onto a set",
abstract = "The problem of orthogonal projection of a point onto a set is an essential problem of computational geometry. This problem has many practical applications in different areas such as robotics, computer graphics and so on. In the present paper three algorithms for solving this problem are proposed. This algorithms are based on the idea of heuristic random search. Numerical experiments illustrating the work of the proposed methods are presented.",
keywords = "Heuristic algorithms, orthogonal projection, random search",
author = "Abbasov, {Majid E.} and Bure, {Vladimir M.}",
year = "2019",
month = nov,
day = "26",
doi = "10.1080/03610918.2018.1469764",
language = "English",
volume = "48",
pages = "2866--2876",
journal = "Communications in Statistics Part B: Simulation and Computation",
issn = "0361-0918",
publisher = "Taylor & Francis",
number = "10",

}

RIS

TY - JOUR

T1 - Randomized heuristic algorithms for orthogonal projection of a point onto a set

AU - Abbasov, Majid E.

AU - Bure, Vladimir M.

PY - 2019/11/26

Y1 - 2019/11/26

N2 - The problem of orthogonal projection of a point onto a set is an essential problem of computational geometry. This problem has many practical applications in different areas such as robotics, computer graphics and so on. In the present paper three algorithms for solving this problem are proposed. This algorithms are based on the idea of heuristic random search. Numerical experiments illustrating the work of the proposed methods are presented.

AB - The problem of orthogonal projection of a point onto a set is an essential problem of computational geometry. This problem has many practical applications in different areas such as robotics, computer graphics and so on. In the present paper three algorithms for solving this problem are proposed. This algorithms are based on the idea of heuristic random search. Numerical experiments illustrating the work of the proposed methods are presented.

KW - Heuristic algorithms

KW - orthogonal projection

KW - random search

UR - http://www.scopus.com/inward/record.url?scp=85073257217&partnerID=8YFLogxK

U2 - 10.1080/03610918.2018.1469764

DO - 10.1080/03610918.2018.1469764

M3 - Article

AN - SCOPUS:85073257217

VL - 48

SP - 2866

EP - 2876

JO - Communications in Statistics Part B: Simulation and Computation

JF - Communications in Statistics Part B: Simulation and Computation

SN - 0361-0918

IS - 10

ER -

ID: 35106221