Prelegent: dr Maksim Barketau (National Academy of Sciences of Belarus, Belarus)
Miejsce: Sala seminaryjna B1-8
Data i godzina: 25 czerwca 2018 r., g. 11:00
Abstract: Mathematical programming is a quickly developing area, where considered problems are defined by constraint inequalities and a criterion that is to be minimized on the feasible set defined by the inequalities. Convex programming deals with mathematical programming problems with the convex feasible set and convex criterion. We try to demonstrate the value of the conic programming techniques explaining the Shor Semi-definite Relaxation Scheme.