All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Constraint qualifications and optimality conditions for optimization problems with cardinality constraints

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F16%3A00461165" target="_blank" >RIV/67985556:_____/16:00461165 - isvavai.cz</a>

  • Alternative codes found

    RIV/00216208:11230/16:10328830

  • Result on the web

    <a href="http://dx.doi.org/10.1007/s10107-016-0986-6" target="_blank" >http://dx.doi.org/10.1007/s10107-016-0986-6</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10107-016-0986-6" target="_blank" >10.1007/s10107-016-0986-6</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Constraint qualifications and optimality conditions for optimization problems with cardinality constraints

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Mathematical Programming

  • ISSN

    0025-5610

  • e-ISSN

  • Volume of the periodical

    160

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    25

  • Pages from-to

    353-377

  • UT code for WoS article

    000385191700013

  • EID of the result in the Scopus database

    2-s2.0-84958742372