<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0352600</ARLID> <utime>20240903170622.3</utime><mtime>20110104235959.9</mtime>   <WOS>000284562000010</WOS>         <title language="eng" primary="1">On computation of C-stationary points for equilibrium problems with linear complementarity constraints via homotopy method</title>  <specification> <page_count>24 s.</page_count> </specification>    <serial><ARLID>cav_un_epca*0297163</ARLID><ISSN>0023-5954</ISSN><title>Kybernetika</title><part_num/><part_title/><volume_id>2010</volume_id><volume>4 (2010)</volume><page_num>730-753</page_num><publisher><place/><name>Ústav teorie informace a automatizace AV ČR, v. v. i.</name><year/></publisher></serial>    <keyword>equilibrium problems with complementarity constraints</keyword>   <keyword>homotopy</keyword>   <keyword>C-stationarity</keyword>    <author primary="1"> <ARLID>cav_un_auth*0220207</ARLID> <name1>Červinka</name1> <name2>Michal</name2> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2010/MTR/cervinka-on computation of c-stationary points for equilibrium problems with linear complementarity constraints via homotopy method.pdf</url> </source>        <cas_special> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">In the paper we consider EPCCs with convex quadratic objective functions and one set of complementarity constraints. For this class of problems we propose a possible generalization of the homotopy method for finding stationary points of MPCCs. We analyze the difficulties which arise from this generalization. Numerical results illustrate the performance for randomly generated test problems.</abstract>    <reportyear>2011</reportyear>  <RIV>BC</RIV>     <unknown tag="mrcbC52"> 4 O 4o 20231122134337.3 </unknown>  <permalink>http://hdl.handle.net/11104/0192075</permalink>          <unknown tag="mrcbT16-e">COMPUTERSCIENCECYBERNETICS</unknown> <unknown tag="mrcbT16-f">0.562</unknown> <unknown tag="mrcbT16-g">0.219</unknown> <unknown tag="mrcbT16-h">8.1</unknown> <unknown tag="mrcbT16-i">0.00125</unknown> <unknown tag="mrcbT16-j">0.22</unknown> <unknown tag="mrcbT16-k">463</unknown> <unknown tag="mrcbT16-l">73</unknown> <unknown tag="mrcbT16-q">21</unknown> <unknown tag="mrcbT16-s">0.323</unknown> <unknown tag="mrcbT16-y">20.57</unknown> <unknown tag="mrcbT16-x">0.48</unknown> <unknown tag="mrcbT16-4">Q2</unknown> <unknown tag="mrcbT16-B">27.15</unknown> <unknown tag="mrcbT16-C">23.684</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q2</unknown> <arlyear>2010</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: 0352600.pdf </unknown>    <unknown tag="mrcbU34"> 000284562000010 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 2010 č. 4 2010 730 753 Ústav teorie informace a automatizace AV ČR, v. v. i. </unknown> </cas_special> </bibitem>