Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice
- Autores: Veselov S.I.1, Gribanov D.B.1, Zolotykh N.Y.1, Chirkov A.Y.1
-
Afiliações:
- Institute of Information Technology, Mathematics, and Mechanics
- Edição: Volume 12, Nº 3 (2018)
- Páginas: 587-594
- Seção: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213104
- DOI: https://doi.org/10.1134/S199047891803016X
- ID: 213104
Citar
Resumo
We consider the minimization problem for a symmetric quasiconvex function defined by an oracle on the set of integer points of a square. We formulate an optimality criterion for the solution, obtain a logarithmic lower bound for the complexity of the problem, and propose an algorithm for which the number of inquiries to the oracle is at most thrice the lower bound.
Palavras-chave
Sobre autores
S. Veselov
Institute of Information Technology, Mathematics, and Mechanics
Autor responsável pela correspondência
Email: sergey.veselov@itmm.unn.ru
Rússia, pr. Gagarina 23, Nizhny Novgorod, 603950
D. Gribanov
Institute of Information Technology, Mathematics, and Mechanics
Email: sergey.veselov@itmm.unn.ru
Rússia, pr. Gagarina 23, Nizhny Novgorod, 603950
N. Zolotykh
Institute of Information Technology, Mathematics, and Mechanics
Email: sergey.veselov@itmm.unn.ru
Rússia, pr. Gagarina 23, Nizhny Novgorod, 603950
A. Chirkov
Institute of Information Technology, Mathematics, and Mechanics
Email: sergey.veselov@itmm.unn.ru
Rússia, pr. Gagarina 23, Nizhny Novgorod, 603950
Arquivos suplementares
