<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0461165</ARLID> <utime>20240103212424.6</utime><mtime>20160722235959.9</mtime>   <SCOPUS>84958742372</SCOPUS> <WOS>000385191700013</WOS>  <DOI>10.1007/s10107-016-0986-6</DOI>           <title language="eng" primary="1">Constraint qualifications and optimality conditions for optimization problems with cardinality constraints</title>  <specification> <page_count>25 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0257227</ARLID><ISSN>0025-5610</ISSN><title>Mathematical Programming</title><part_num/><part_title/><volume_id>160</volume_id><volume>1 (2016)</volume><page_num>353-377</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>Cardinality constraints</keyword>   <keyword>Constraint qualifications</keyword>   <keyword>Optimality conditions</keyword>   <keyword>KKT conditions</keyword>   <keyword>Strongly stationary points</keyword>    <author primary="1"> <ARLID>cav_un_auth*0220207</ARLID> <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> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Červinka</name1> <name2>Michal</name2> <institution>UTIA-B</institution> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0021120</ARLID>  <name1>Kanzow</name1> <name2>Ch.</name2> <country>DE</country> </author> <author primary="0"> <ARLID>cav_un_auth*0332700</ARLID>  <name1>Schwartz</name1> <name2>A.</name2> <country>DE</country> </author>   <source> <url>http://library.utia.cas.cz/separaty/2016/MTR/cervinka-0461165.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0284931</ARLID> <project_id>GAP402/12/1309</project_id> <agency>GA ČR</agency> </project> <project> <ARLID>cav_un_auth*0321507</ARLID> <project_id>GA15-00735S</project_id> <agency>GA ČR</agency> </project>  <abstract language="eng" primary="1">This paper considers optimization problems with cardinality constraints.  Based on a recently introduced reformulation of this problem as a nonlinear program  with continuous variables, we first define some problem-tailored constraint qualifications and then show how these constraint qualifications can be used to obtain suitable  optimality conditions for cardinality constrained problems. Here, the (KKT-like) optimality conditions hold under much weaker assumptions than the corresponding result  that is known for the somewhat related class of mathematical programs with complementarity constraints.</abstract>     <RIV>BA</RIV>    <reportyear>2017</reportyear>      <num_of_auth>3</num_of_auth>  <unknown tag="mrcbC52"> 4 A hod 4ah 20231122141800.5 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0261535</permalink>  <cooperation> <ARLID>cav_un_auth*0331650</ARLID> <name>Charles University in Prague</name> <country>CZ</country> </cooperation> <cooperation> <ARLID>cav_un_auth*0331687</ARLID> <name>Institute of Mathematics, University of Würzburg</name> <country>DE</country> </cooperation> <cooperation> <ARLID>cav_un_auth*0331688</ARLID> <name>Graduate School of Computational Engineering, TU Darmstadt</name> <country>DE</country> </cooperation> <unknown tag="mrcbC64"> 1 Department of Decision Making Theory UTIA-B 10102 MATHEMATICS, APPLIED </unknown>  <confidential>S</confidential>  <unknown tag="mrcbC86"> 1 Article Computer Science Software Engineering|Operations Research Management Science|Mathematics Applied  </unknown>         <unknown tag="mrcbT16-e">MATHEMATICS.APPLIED|OPERATIONSRESEARCH&amp;MANAGEMENTSCIENCE|COMPUTERSCIENCE.SOFTWAREENGINEERING</unknown> <unknown tag="mrcbT16-f">2.985</unknown> <unknown tag="mrcbT16-g">0.65</unknown> <unknown tag="mrcbT16-h">999.9</unknown> <unknown tag="mrcbT16-i">0.01892</unknown> <unknown tag="mrcbT16-j">2.436</unknown> <unknown tag="mrcbT16-k">8568</unknown> <unknown tag="mrcbT16-s">3.158</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-5">2.176</unknown> <unknown tag="mrcbT16-6">117</unknown> <unknown tag="mrcbT16-7">Q1</unknown> <unknown tag="mrcbT16-B">97.403</unknown> <unknown tag="mrcbT16-C">84.8</unknown> <unknown tag="mrcbT16-D">Q1*</unknown> <unknown tag="mrcbT16-E">Q1*</unknown> <unknown tag="mrcbT16-P">94.706</unknown> <arlyear>2016</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: cervinka-0461165.pdf </unknown>    <unknown tag="mrcbU14"> 84958742372 SCOPUS </unknown> <unknown tag="mrcbU34"> 000385191700013 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0257227 Mathematical Programming 0025-5610 1436-4646 Roč. 160 č. 1 2016 353 377 Springer </unknown> </cas_special> </bibitem>