On stability and stationary points in nonlinear optimization
From MaRDI portal
Publication:3756878
DOI10.1017/S033427000000518XzbMath0621.49016OpenAlexW2161902547MaRDI QIDQ3756878
Hubertus Th. Jongen, Jürgen Guddat, Jan-Joachim Rückmann
Publication date: 1986
Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s033427000000518x
stabilityconstrained minimizationstationary pointsfeasible setMangasarian- Fromovitz constraint qualification
Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Related Items
Semi-infinite optimization: Structure and stability of the feasible set, Stable parametric programming*, Characterizing optimality in mathematical programming models, On generalized semi-infinite programming. (With comments and rejoinder)., Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding, On equivalent stability properties in semi-infinite optimization, Disjunctive optimization: Critical point theory, Structural stability in nonlinear optimization, Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung, Methods of embedding-cutting off in problems of mathematical programming, Generalized semi-infinite programming: a tutorial, Generalized semi-infinite programming: numerical aspects, Nonlinear optimization: Characterization of structural stability, Smoothing by mollifiers. I: Semi-infinite optimization, Fundamental theorems of Morse theory for optimization on manifolds with corners, On constraint qualifications in nonsmooth optimization., On parametric nonlinear programming, Generalized semi-infinite programming: Theory and methods, Strong stability implies Mangasarian–Fromovitz Constraint Qualification, On the topological complexity of DC-sets, On constraint qualifications, An approximation of feasible sets in semi-infinite optimization.