Stetsyuk P. Nondifferentiable optimization algorithms and Lagrangian dual bounds in complex extremal problems

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

Thesis for the degree of Doctor of Science (DSc)

State registration number

0513U000283

Thesis Registration Form

0513U000283.pdf

Applicant for

Specialization

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

22-03-2013

Specialized Academic Board

Д 26.194.02

V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine

Essay

New subgradient methods with space transformation were developed, their effectiveness to minimize ravine functions was explored. New methods to construct superfluous constraints in quadratic extremal problems with boolean and binary variables were developed. Based on them the improved dual estimates for weighted stability number of a graph, for weighted maximum cut of a graph were obtained. The proposed methods may be applied to obtain the optimal parameters of economic, transport and energy systems.

Read more

Files

aref.doc

aref.doc

dis.doc

dis.doc

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.