Поиск

Автор

Ключевое слово

Тип статьи

DOI

ORCID

Дополнительно:

Период публикации

Репозиторий

По вашему запросу найдено документов: 81092

Страница 4 из 8110

descent type method to find its solution. If the primal cost function does not possess strengthened

decomposition descent method. Its convergence is attained under coercivity type conditions.

bifunction. We propose a combined regularization and descent method for this problem and establish strong

and suggest a descent type algorithm to find solutions to the initial problem.

We propose a decentralized penalty method for general convex constrained multi-agent optimization

descent type method to find its solution. If the primal cost function does not possess strengthened

. To solve the problem of multiobjective synthesis the numerical method was developed. This method is based

propose a modification of the method of bi-coordinate variations for network equilibrium problems

and suggest a descent type algorithm to find solutions to the initial problem.

descent solution methods. This approach gives suitable trajectories tending to a relatively optimal state

Страница 4 из 8110