Norkin V. Stochastic methods for solving nonconvex stochastic programming problems and their applications

Українська версія

Thesis for the degree of Doctor of Science (DSc)

State registration number

0599U000057

Thesis Registration Form

0599U000057.pdf

Applicant for

Specialization

  • 01.05.01 - Теоретичні основи інформатики та кібернетики

26-02-1999

Specialized Academic Board

Д26.194.02

Essay

Nonconvex stochastic programming problems. To develop stochastic methods for searching local and global optimums. Research methods include convex and nonsmooth analysis, convex stochastic programming theory. Stochastic generalized gradient methods for local optimization and stochastic branch and bound methods for stochastic global and discrete optimization are developed. Applications include operations research, system analysis, optimization of stochastic networks.

Read more

Similar theses

0421U102388

Nasirov Emil Mekhdiievych

Parallelization of non-negative huge sparse linguistic matrix and tensors factorization

0420U102355

Dudar Vyacheslav Vyacheslavovych

Training algorithms and invariance to geometric transformations of neural networks

0520U101700

Prytomanova Olga M.

Fuzzy problems of optimal set partitioning: theoretical bases, methods and algorithms for solving

0520U100242

Zavadskyi Ihor O.

Splittable codes and their applications

0520U100209

Rystsov Ihor

Application of algebraic automata theory to analysis of discrete dynamical systems.