{"id":34,"date":"2022-09-14T19:02:26","date_gmt":"2022-09-14T19:02:26","guid":{"rendered":"http:\/\/www.ccor.hu\/?p=34"},"modified":"2022-09-14T19:02:27","modified_gmt":"2022-09-14T19:02:27","slug":"ccor-workshop-on-horizontal-lcps","status":"publish","type":"post","link":"http:\/\/www.ccor.hu\/?p=34","title":{"rendered":"CCOR workshop on horizontal LCPs"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\">CCOR in CIAS organizes a workshop entitled \u201cA class of algebraically<br>equivalent transformations for symmetric cone horizontal linear complementarity<br>problems\u201d with three speakers, Zsolt Darvay, Petra Ren\u00e1ta Rig\u00f3 and Roland T\u00f6r\u00f6k.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">The date of the workshop is: September 22, 13:00-16:00<br>It will be organized in a hybrid way, you can attend in person in room C.510, or connect<br>online via Teams.<br>13:00-13:30<br>Petra Ren\u00e1ta Rig\u00f3: New predictor-corrector interior-point algorithm with AET<br>function having inflection point<br>We present a new predictor-corrector interior-point algorithm (PC IPA) for solving P*(\u039a)-<br>linear complementarity problems. We use the algebraically equivalent transformation<br>(AET) technique in order to determine the search directions. In this method we apply the<br>function which has inflection point. It is interesting that the kernel corresponding to this<br>AET function is neither self-regular, nor eligible. We show that the iteration bound of the<br>algorithm matches the best known iteration bound for this type of PC IPAs given in the<br>literature.<\/p>\n\n\n\n<p class=\"has-text-align-left wp-block-paragraph\">13:30-14:00<br>Roland T\u00f6r\u00f6k: Implementation of predictor-corrector interior-point method based on<br>a new AET fuction<br>In this presentation we show numerical results about a new predictor-corrector (PC)<br>interior-point algorithm (IPA) for solving sufficient linear complementarity problems. We<br>applied a function having inflection point on the nonlinear equation of the central path<br>system to define new search directions. We consider numerical results of our new method<br>compared to other PC IPAs that use different search directions.<\/p>\n\n\n\n<p class=\"has-text-align-left wp-block-paragraph\">14:00-14:30 Coffee break<\/p>\n\n\n\n<p class=\"has-text-align-left wp-block-paragraph\">14:30-16:00<br>Zsolt Darvay: A class of algebraically equivalent transformations for symmetric<br>cone horizontal linear complementarity problems<br>In this talk, we present a generalization of the interior-point algorithms (IPAs) introduced by<br>Ill\u00e9s, Rig\u00f3, and T\u00f6r\u00f6k [Unified approach of primal-dual interior-point algorithms for a new<br>class of AET functions, Corvinus Econ. Work. Paper. 2022\/02 (2022)]. This class of<br>algorithms is based on the algebraically equivalent transformation (AET) of the central<br>path system. We propose a modification of the class presented by Ill\u00e9s, Rig\u00f3, and T\u00f6r\u00f6k.<br>In the general framework of P*(\u039a)-horizontal linear complementarity problems over the<br>Cartesian product of symmetric cones, we prove the polynomial iteration complexity of the<br>new algorithms.<\/p>\n\n\n\n<p class=\"has-text-align-left wp-block-paragraph\">You can inquire about connecting online at the email address<br>marianna.eisenberg-nagy@uni-corvinus.hu.<\/p>\n\n\n\n<p class=\"has-text-align-left wp-block-paragraph\">We encourage all interested colleagues to participate at these interesting events.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>CCOR in CIAS organizes a workshop entitled \u201cA class of algebraicallyequivalent transformations for symmetric cone horizontal linear complementarityproblems\u201d with three speakers, Zsolt Darvay, Petra Ren\u00e1ta Rig\u00f3 and Roland T\u00f6r\u00f6k. The date of the workshop is: September 22, 13:00-16:00It will be <span class=\"readmore\"><a href=\"http:\/\/www.ccor.hu\/?p=34\">Continue Reading &#8230;<\/a><\/span><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-34","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"http:\/\/www.ccor.hu\/index.php?rest_route=\/wp\/v2\/posts\/34","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.ccor.hu\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.ccor.hu\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.ccor.hu\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/www.ccor.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=34"}],"version-history":[{"count":2,"href":"http:\/\/www.ccor.hu\/index.php?rest_route=\/wp\/v2\/posts\/34\/revisions"}],"predecessor-version":[{"id":36,"href":"http:\/\/www.ccor.hu\/index.php?rest_route=\/wp\/v2\/posts\/34\/revisions\/36"}],"wp:attachment":[{"href":"http:\/\/www.ccor.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=34"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.ccor.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=34"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.ccor.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=34"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}