On stability and stationary points in nonlinear optimization

DOI10.1017/S033427000000518XMaRDI QIDQ3756878zbMATH OpenOpenAlexFDO

Authors Jürgen Guddat, Hubertus T. Jongen, 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

zbMATH Keywords

stabilityconstrained minimizationstationary pointsfeasible setMangasarian- Fromovitz constraint qualification

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Sensitivity, stability, well-posedness (49K40)

Recommendations

• scientific article; zbMATH DE number 841075
• Semi-infinite optimization: Structure and stability of the feasible set
• Nonlinear optimization: Characterization of structural stability
• scientific article; zbMATH DE number 4145670
• Strong stability of stationary solutions and Karush-Kuhn-Tucker points in nonlinear optimization

Cited in

(31)

• ON THE STABILITY OF STATIONARY SOLUTIONS OF NONLINEAR POSITIVE SEMIDEFINITE PROGRAMS
• On equivalent stability properties in semi-infinite optimization
• Fundamental theorems of Morse theory for optimization on manifolds with corners
• Characterizing optimality in mathematical programming models
• On parametric nonlinear programming
• Nonlinear optimization: Characterization of structural stability
• On constraint qualifications in nonsmooth optimization.
• Generalized semi-infinite programming: numerical aspects
• Nonlinear Optimization: On Connected Components of Level Sets
• On stability concepts in nonlinear programming
• Strong stability implies Mangasarian–Fromovitz Constraint Qualification
• Stable parametric programming^*
• Generalized semi-infinite programming: a tutorial
• On the topological complexity of DC-sets
• Methods of embedding-cutting off in problems of mathematical programming
• Disjunctive optimization: Critical point theory
• On constraint qualifications
• Stationary point sets: convex quadratic optimization is universal in nonlinear optimization
• On the computation of linearly constrained stationary points
• Generalized semi-infinite programming: Theory and methods
• Stationary points of the finite length constant modulus optimization
• scientific article; zbMATH DE number 4189484 (Why is no real title available?)
• scientific article; zbMATH DE number 4145670 (Why is no real title available?)
• Smoothing by mollifiers. I: Semi-infinite optimization
• Structural stability in nonlinear optimization
• An approximation of feasible sets in semi-infinite optimization.
• Semi-infinite optimization: Structure and stability of the feasible set
• Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung
• On generalized semi-infinite programming. (With comments and rejoinder).
• Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding
• On the existence of stationary points for the Steiglitz-McBride algorithm

This page was built for publication: On stability and stationary points in nonlinear optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756878)