Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

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.

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

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2018