Nenakhov E. Methods for solution of nonsmooth convex problems of mathematical programming and their applications

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

Thesis for the degree of Doctor of Science (DSc)

State registration number

0500U000186

Thesis Registration Form

0500U000186.pdf

Applicant for

Specialization

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

26-05-2000

Specialized Academic Board

Д 26.194.02

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

Essay

The problem of embedding matrix optimization problems into general class of optimization problems is investigated, and the necessary (and for convex problems sufficient) conditions of minimum are formulated. The properties of the cone of symmetrical positively defined matrices are investigated, a method of solving the problem of minimization of matrix parametrical functions with restriction of nonnegative definiteness. The sufficient conditions of solvability of the ball problem) non-combinatorial methods are stated.

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.