Semi-infinite optimization: Structure and stability of the feasible set
From MaRDI portal
Publication:1336072
DOI10.1007/BF00939841zbMath0807.90113OpenAlexW2038398448MaRDI QIDQ1336072
Gerhard-Wilhelm Weber, Frank Twilt, Hubertus Th. Jongen
Publication date: 1 November 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00939841
genericityreduction principleMangasarian-Fromovitz constraint qualificationfinitely many equality constraintsinfinitely many inequality constraintstopological stability of the feasible set
Related Items
Metric regularity of the feasible set mapping in semi-infinite optimization ⋮ Optimality conditions in convex multiobjective SIP ⋮ On equivalent representations and properties of faces of the cone of copositive matrices ⋮ On regularity and stability in semi-infinite optimization ⋮ Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions ⋮ Feasible Method for Semi-Infinite Programs ⋮ Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ A fuzzy semi-infinite optimization problem ⋮ On equivalent stability properties in semi-infinite optimization ⋮ Disjunctive optimization: Critical point theory ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems ⋮ SIP: critical value functions have finite modulus of non-convexity ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ On Proper Efficiency in Multiobjective Semi-infinite Optimization ⋮ Mathematical contributions to dynamics and optimization of gene-environment networks ⋮ Stability in linear optimization and related topics. A personal tour ⋮ Regularity modulus of arbitrarily perturbed linear inequality systems ⋮ Mathematical encouragement of companies to cooperate by using cooperative games with fuzzy approach ⋮ Chance constrained optimization of elliptic PDE systems with a smoothing convex approximation ⋮ A noninterior path following algorithm for solving a class of multiobjective programming problems ⋮ Stability advances in robust portfolio optimization under parallelepiped uncertainty ⋮ On the equivalence of parametric contexts for linear inequality systems ⋮ Nonlinear optimization: Characterization of structural stability ⋮ Smoothing by mollifiers. I: Semi-infinite optimization ⋮ Optimality, scalarization and duality in linear vector semi-infinite programming ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ How to solve a semi-infinite optimization problem ⋮ On topological properties of min-max functions ⋮ On constraint qualifications in nonsmooth optimization. ⋮ On the stability of linear systems with an exact constraint set ⋮ On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems ⋮ Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity ⋮ Analytic approximation and differentiability of joint chance constraints ⋮ Stability of the feasible set mapping of linear systems with an exact constraint set ⋮ Cooperative grey games and the grey Shapley value ⋮ Эффективная вычислительная процедура альтернансного метода оптимизации ⋮ Generalized semi-infinite optimization: A first order optimality condition and examples ⋮ Topological stability of linear semi-infinite inequality systems ⋮ Unnamed Item ⋮ On feasible sets defined through Chebyshev approximation ⋮ Linear semi-infinite programming theory: an updated survey ⋮ Metric regularity of semi-infinite constraint systems ⋮ On constraint qualifications ⋮ An approximation of feasible sets in semi-infinite optimization.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to sensitivity and stability analysis in nonlinear programming
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
- Optimization and nonsmooth analysis
- On stability and stationary points in nonlinear optimization
- On linearization and continuous selections of functions
- On sufficient conditions for local optimality in semi-infinite programming
