Standard

Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function. / Просолупов, Евгений Викторович; Тамасян, Григорий Шаликович.

в: Journal of Applied and Industrial Mathematics, Том 12, № 2, 01.04.2018, стр. 325-333.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Просолупов, ЕВ & Тамасян, ГШ 2018, 'Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function', Journal of Applied and Industrial Mathematics, Том. 12, № 2, стр. 325-333. https://doi.org/10.1134/S1990478918020126

APA

Просолупов, Е. В., & Тамасян, Г. Ш. (2018). Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function. Journal of Applied and Industrial Mathematics, 12(2), 325-333. https://doi.org/10.1134/S1990478918020126

Vancouver

Просолупов ЕВ, Тамасян ГШ. Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function. Journal of Applied and Industrial Mathematics. 2018 Апр. 1;12(2):325-333. https://doi.org/10.1134/S1990478918020126

Author

Просолупов, Евгений Викторович ; Тамасян, Григорий Шаликович. / Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function. в: Journal of Applied and Industrial Mathematics. 2018 ; Том 12, № 2. стр. 325-333.

BibTeX

@article{becc47bbbc6247d08942bedeb1df40e6,
title = "Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function",
abstract = "It is known that the problem of the orthogonal projection of a point to the standard simplex can be reduced to solution of a scalar equation. In this article, the complexity is analyzed of an algorithm of searching for zero of a piecewise linear convex function which is proposed in [30]. The analysis is carried out of the best and worst cases of the input data for the algorithm. To this end, the largest and smallest numbers of iterations of the algorithm are studied as functions of the size of the input data. It is shown that, in the case of equality of elements of the input set, the algorithm performs the smallest number of iterations. In the case of different elements of the input set, the number of iterations is maximal and depends rather weakly on the particular values of the elements of the set. The results of numerical experiments with random input data of large dimension are presented. ",
keywords = "ORTHOGONAL PROJECTION OF POINT, STANDARD SIMPLEX, ZEROS OF FUNCTION, orthogonal projection of point, standard simplex, zeros of function",
author = "Просолупов, {Евгений Викторович} and Тамасян, {Григорий Шаликович}",
year = "2018",
month = apr,
day = "1",
doi = "10.1134/S1990478918020126",
language = "English",
volume = "12",
pages = "325--333",
journal = "Journal of Applied and Industrial Mathematics",
issn = "1990-4789",
publisher = "МАИК {"}Наука/Интерпериодика{"}",
number = "2",

}

RIS

TY - JOUR

T1 - Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function

AU - Просолупов, Евгений Викторович

AU - Тамасян, Григорий Шаликович

PY - 2018/4/1

Y1 - 2018/4/1

N2 - It is known that the problem of the orthogonal projection of a point to the standard simplex can be reduced to solution of a scalar equation. In this article, the complexity is analyzed of an algorithm of searching for zero of a piecewise linear convex function which is proposed in [30]. The analysis is carried out of the best and worst cases of the input data for the algorithm. To this end, the largest and smallest numbers of iterations of the algorithm are studied as functions of the size of the input data. It is shown that, in the case of equality of elements of the input set, the algorithm performs the smallest number of iterations. In the case of different elements of the input set, the number of iterations is maximal and depends rather weakly on the particular values of the elements of the set. The results of numerical experiments with random input data of large dimension are presented.

AB - It is known that the problem of the orthogonal projection of a point to the standard simplex can be reduced to solution of a scalar equation. In this article, the complexity is analyzed of an algorithm of searching for zero of a piecewise linear convex function which is proposed in [30]. The analysis is carried out of the best and worst cases of the input data for the algorithm. To this end, the largest and smallest numbers of iterations of the algorithm are studied as functions of the size of the input data. It is shown that, in the case of equality of elements of the input set, the algorithm performs the smallest number of iterations. In the case of different elements of the input set, the number of iterations is maximal and depends rather weakly on the particular values of the elements of the set. The results of numerical experiments with random input data of large dimension are presented.

KW - ORTHOGONAL PROJECTION OF POINT

KW - STANDARD SIMPLEX

KW - ZEROS OF FUNCTION

KW - orthogonal projection of point

KW - standard simplex

KW - zeros of function

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

UR - http://www.mendeley.com/research/complexity-estimation-algorithm-searching-zero-piecewise-linear-convex-function

U2 - 10.1134/S1990478918020126

DO - 10.1134/S1990478918020126

M3 - Article

VL - 12

SP - 325

EP - 333

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 2

ER -

ID: 35369343