Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
From MaRDI portal
Publication:1893967
DOI10.1016/0377-0427(94)90384-0zbMath0823.90121OpenAlexW1977898090MaRDI QIDQ1893967
Publication date: 13 July 1995
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(94)90384-0
metric regularityconstraint qualificationssecond-order conditionsnonlinear semi-infinite optimization problemsstability concepts for local minimizersstable local minimizers
Related Items
The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming, On generalized semi-infinite programming. (With comments and rejoinder)., On saddle points in nonconvex semi-infinite programming, Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets, Implicit optimality criterion for convex SIP problem with box constrained index set, Generalized semi-infinite programming: a tutorial, Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem, On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets, A characterization of strict local minimizers of order one for nonsmooth static minmax problems, On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems, Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices, Isolated calmness of solution mappings in convex semi-infinite optimization, Semi-infinite programming, duality, discretization and optimality conditions†, Optimality conditions in smooth nonlinear programming, Unnamed Item, A Characterization of Strict Local Minimizers of Order One for Static Minmax Problems in the Parametric Constraint Case
Cites Work
- Metric regularity, tangent sets, and second-order optimality conditions
- Approximate subdifferential and metric regularity: The finite-dimensional case
- Stability and regular points of inequality systems
- Distribution sensitivity in stochastic programming
- Variational analysis of a composite function: A formula for the lower second order epi-derivative
- Second-order necessary and sufficient optimality conditions for minimizing a sup-type function
- Regularity and stability for the mathematical programming problem in Banach spaces
- On constraint qualifications
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Metric regularity of the feasible set mapping in semi-infinite optimization
- Semi-infinite optimization: Structure and stability of the feasible set
- Stability in Mathematical Programming with Nondifferentiable Data
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs
- Solution point differentiability without strict complementarity in nonlinear programming
- Lipschitzian properties of multifunctions
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Local epi-continuity and local optimization
- Stability in Two-Stage Stochastic Programming
- Strongly Regular Generalized Equations
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- On regularity conditions in mathematical programming
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Sensitivity Analysis of Parametrized Programs under Cone Constraints
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Differentiable stability in non convex and non differentiable programming
- Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
- Sensitivity Analysis of Parametrized Programs via Generalized Equations
- On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization
- On sufficient conditions for local optimality in semi-infinite programming
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
