About: Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian–Fromovitz Constraint Qualification, we establish relationships between tilt stability and some other stability notions in constrained optimization. Involving further the well-known Constant Rank Constraint Qualification, we derive new necessary and sufficient conditions for tilt-stable local minimizers.
  • The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian–Fromovitz Constraint Qualification, we establish relationships between tilt stability and some other stability notions in constrained optimization. Involving further the well-known Constant Rank Constraint Qualification, we derive new necessary and sufficient conditions for tilt-stable local minimizers. (en)
Title
  • Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
  • Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification (en)
skos:prefLabel
  • Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
  • Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification (en)
skos:notation
  • RIV/67985556:_____/13:00393907!RIV14-GA0-67985556
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I, P(GAP201/12/0671)
http://linked.open...iv/cisloPeriodika
  • 3
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 111079
http://linked.open...ai/riv/idVysledku
  • RIV/67985556:_____/13:00393907
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • variational analysis; second-order theory; generalized differentiation; tilt stability (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • CZ - Česká republika
http://linked.open...ontrolniKodProRIV
  • [FE65D9758E0A]
http://linked.open...i/riv/nazevZdroje
  • Kybernetika
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 49
http://linked.open...iv/tvurceVysledku
  • Outrata, Jiří
  • Mordukhovich, B. S.
http://linked.open...ain/vavai/riv/wos
  • 000322858500006
issn
  • 0023-5954
number of pages
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software