<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0569933</ARLID> <utime>20240402213654.2</utime><mtime>20230313235959.9</mtime>   <SCOPUS>85141479391</SCOPUS> <WOS>000879681900001</WOS>  <DOI>10.1007/s10589-022-00429-0</DOI>           <title language="eng" primary="1">On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction</title>  <specification> <page_count>33 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0252565</ARLID><ISSN>0926-6003</ISSN><title>Computational Optimization and Applications</title><part_num/><part_title/><volume_id>86</volume_id><volume>3 (2023)</volume><page_num>1159-1191</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>Newton method</keyword>   <keyword>semismoothness*</keyword>   <keyword>Subspace containing derivative</keyword>   <keyword>Generalized equation</keyword>   <keyword>Signorini problem with Coulomb friction</keyword>    <author primary="1"> <ARLID>cav_un_auth*0319636</ARLID> <name1>Gfrerer</name1> <name2>H.</name2> <country>AT</country> </author> <author primary="0"> <ARLID>cav_un_auth*0447353</ARLID> <name1>Mandlmayr</name1> <name2>M.</name2> <country>AT</country> </author> <author primary="0"> <ARLID>cav_un_auth*0101173</ARLID> <name1>Outrata</name1> <name2>Jiří</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <full_dept>Department of Decision Making Theory</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0292941</ARLID> <name1>Valdman</name1> <name2>Jan</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <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/2023/MTR/valdman-0569933.pdf</url> </source> <source> <url>https://link.springer.com/article/10.1007/s10589-022-00429-0</url>  </source>        <cas_special> <project> <project_id>GA22-15524S</project_id> <agency>GA ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0447354</ARLID> </project> <project> <project_id>GF21-06569K</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0412957</ARLID> </project> <project> <project_id>8J21AT001</project_id> <agency>GA MŠk</agency> <ARLID>cav_un_auth*0413224</ARLID> </project>  <abstract language="eng" primary="1">In the paper, a variant of the semismooth* Newton method is developed for the numerical solution of generalized equations, in which the multi-valued part is a so-called SCD (subspace containing derivative) mapping. Under a rather mild regularity requirement, the method exhibits (locally) superlinear convergence behavior. From the main conceptual algorithm, two implementable variants are derived whose efficiency is tested via a generalized equation modeling a discretized static contact problem with Coulomb friction.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10101</FORD2>    <reportyear>2024</reportyear>     <inst_support> RVO:67985556 </inst_support>  <permalink>https://hdl.handle.net/11104/0347209</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> Article Operations Research Management Science|Mathematics Applied </unknown> <unknown tag="mrcbC91"> A </unknown>         <unknown tag="mrcbT16-e">OPERATIONSRESEARCH&amp;MANAGEMENTSCIENCE|MATHEMATICS.APPLIED</unknown> <unknown tag="mrcbT16-f">2</unknown> <unknown tag="mrcbT16-g">0.4</unknown> <unknown tag="mrcbT16-h">9.6</unknown> <unknown tag="mrcbT16-i">0.00444</unknown> <unknown tag="mrcbT16-j">1.103</unknown> <unknown tag="mrcbT16-k">3171</unknown> <unknown tag="mrcbT16-q">91</unknown> <unknown tag="mrcbT16-s">1.322</unknown> <unknown tag="mrcbT16-y">40.35</unknown> <unknown tag="mrcbT16-x">2.04</unknown> <unknown tag="mrcbT16-3">653</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-5">1.400</unknown> <unknown tag="mrcbT16-6">95</unknown> <unknown tag="mrcbT16-7">Q2</unknown> <unknown tag="mrcbT16-C">56.3</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <unknown tag="mrcbT16-M">0.79</unknown> <unknown tag="mrcbT16-N">Q2</unknown> <unknown tag="mrcbT16-P">73.3</unknown> <arlyear>2023</arlyear>       <unknown tag="mrcbU14"> 85141479391 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000879681900001 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0252565 Computational Optimization and Applications 86 3 2023 1159 1191 0926-6003 1573-2894 Springer </unknown> </cas_special> </bibitem>