Exact penalty results for mathematical programs with vanishing constraints

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F10%3A00336815" target="_blank" >RIV/67985556:_____/10:00336815 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Exact penalty results for mathematical programs with vanishing constraints

Original language description

A 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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/IAA100750802" target="_blank" >IAA100750802: Nonsmooth and set-valued analysis in mechanics and thermomechanics</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

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

Name of the periodical

Nonlinear Analysis: Theory, Methods & Applications

ISSN

0362-546X

e-ISSN

—

Volume of the periodical

72

Issue of the periodical within the volume

5

Country of publishing house

GB - UNITED KINGDOM

Number of pages

13

Pages from-to

—

UT code for WoS article

000273924100037

EID of the result in the Scopus database

—