Number of the records: 1  

Exact penalty results for mathematical programs with vanishing constraints

  1. 1.
    SYSNO ASEP0336815
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleExact penalty results for mathematical programs with vanishing constraints
    TitleVyužití přesných pokutových funkcí u matematických úloh s mizícími omezeními
    Author(s) Hoheisel, T. (DE)
    Kanzow, Ch. (DE)
    Outrata, Jiří (UTIA-B) RID, ORCID
    Number of authors3
    Source TitleNonlinear Analysis: Theory, Methods & Applications. - : Elsevier - ISSN 0362-546X
    Roč. 72, č. 5 (2010), s. 2514-2526
    Number of pages13 s.
    Languageeng - English
    CountryGB - United Kingdom
    KeywordsMathematical programs with vanishing constraints ; Mathematical programs with equilibrium constraints ; Exact penalization ; Calmness ; Subdifferential calculus ; Limiting normal cone
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA100750802 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    CEZAV0Z10750506 - UTIA-B (2005-2011)
    UT WOS000273924100037
    DOI10.1016/j.na.2009.10.047
    AnnotationA mathematical program with vanishing constraints (MPVC) is a constrained optimization problem arising in certain engineering applications. The feasible set has a complicated structure so that the most familiar constraint qualifications are usually violated. This, in turn, implies that standard penalty functions are typically non-exact for MPVCs. We therefore develop a new MPVC-tailored penalty function which is shown to be exact under reasonable assumptions. This new penalty function can then be used to derive (or recover) suitable optimality conditions for MPVCs.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.