On existence and uniqueness of stationary points in semi-infinite optimization

DOI10.1007/S101070050095MaRDI QIDQ1961986zbMATH OpenOpenAlexFDO

Authors Jan-Joachim Rückmann

Publication date 11 October 2000

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s101070050095

zbMATH Keywords

extended Mangasarian-Fromovitz constraint qualificationsemi-infinite optimizationstationary pointstrong stability

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)

Review text

The semi-infinite optimization problems dealt with in this paper are those whose constraint sets are defined by finitely many equality and infinitely many inequality constraints. The author extends to this setting the concept of strong stability of a stationary point introduced by \textit{M. Kojima} [Analysis and computation of fixed points, Proc. Symp., Univ. Wis. 1979, 93-138 (1980; Zbl 0478.90062)] for problems with finitely many constraints, and presents several equivalent conditions.

Recommendations

• On equivalent stability properties in semi-infinite optimization
• scientific article; zbMATH DE number 4114365
• scientific article; zbMATH DE number 125252
• Semi-infinite programming: strong stability implies EMFCQ
• scientific article; zbMATH DE number 686907

Cited in

(22)

• On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization
• On the uniqueness of optimal solutions in continuous location theory
• Generalized semi-infinite optimization: A first order optimality condition and examples
• Stationary points of the finite length constant modulus optimization
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
• An approximation of feasible sets in semi-infinite optimization.
• SIP: critical value functions have finite modulus of non-convexity
• On saddle points in nonconvex semi-infinite programming
• Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization
• MPCC: strong stability of \(m\)-stationary points
• Strongly stable C-stationary points for mathematical programs with complementarity constraints
• scientific article; zbMATH DE number 125252 (Why is no real title available?)
• On the existence of stationary points for the Steiglitz-McBride algorithm
• MPCC: on necessary conditions for the strong stability of C-stationary points
• scientific article; zbMATH DE number 4114365 (Why is no real title available?)
• Semi-infinite programming: strong stability implies EMFCQ
• An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
• Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
• MPCC: strongly stable C-stationary points when the number of active constraints is \(n + 1\)
• A tutorial note on a convexification procedure in non-convex semi-infinite optimization
• Strongly Stable Stationary Points for a Class of Generalized Equations
• On the convergence of local solutions for the method quADAPT

This page was built for publication: On existence and uniqueness of stationary points in semi-infinite optimization

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