Friday, 15:45 - 16:10 h, Room: H 0112


Alexander Strekalovskiy
New mathematical tools for new optimization problems


Following new paradigms of J.-S. Pang [Math. Program., Ser.B (2010) 125: 297-323] in mathematical optimization - competition, hierarchy and dynamics - we consider complementarity problems, bimatrix games, bilevel optimization problems etc, which turn out to be optimization problems with hidden nonconvexities.
However, classical optimization theory and method do not provide tools to escape stationary (critical, KKT) points produced by local search algorithms. As well-known, the conspicuous limitation of (classical) convex optimization methods applied to nonconvex problems is their ability of being trapped at a local extremum or even a critical point depending on a starting point. So, the nonconvexity, hidden or explicit, claims new mathematical tools allowing to reach a global solution through, say, a number of critical points.
In such a situation we advanced another approach the core of which is composed by global optimality conditions (GOC) for principal classes of d.c. programming problems. Furthermore, several special local search methods (SLSM) have been developed. Such an approach shows itself really efficient and allows to apply suitable package as X-Press, CPLEX etc.


Talk 2 of the contributed session Fri.3.H 0112
"Optimality conditions II" [...]
Cluster 16
"Nonlinear programming" [...]


  payday advance . Of course, the choice is not that easy, as there exist great number of different preparations. Notwithstanding, Cialis is the one that definitely differs from all other products.