ÊýѧϵSeminar 822
Ö÷Ì⣺Çó½âÏßÐÔ»¥²¹ÎÊÌâµÄ»ùÓں˺¯ÊýµÄÄÚµãËã·¨
»ã±¨ÈË£ºGoran Lesaja ½ÌÊÚ£¨Georgia Southern University, Statesboro, Georgia, USA)
¹¦·ò£º2013Äê12ÔÂ10ÈÕ£¨Öܶþ)9:00
µØÖ·£ºÐ£±¾²¿G507
Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

ÌáÒª£ºLinear Complementarity Problems (LCP) is an important class of problems closely related to many optimization problems. Thus, efficient algorithms for solving LCP are of the interest for theoretical and practical purposes.

In this talk a Feasible Interior-Point Methods (IPM) based on the class of eligible kernel functions is presented. This class is fairly general and includes the classical logarithmic function, the prototype self-regular function, and non-self-regular kernel functions as special cases. It will be will be shown that the method globally converges and iteration bounds to obtain epsilon-approximate solution matches best known iteration bounds for these types of methods. In particular, one of the main achievements of the kernel-based IPMs is the improved complexity of long-step methods.