Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
From MaRDI portal
Publication:3083308
Recommendations
- Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
- Variational analysis in normed spaces with applications to constrained optimization
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Optimality conditions for semi-infinite programming problems involving generalized convexity
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
Cited in
(28)- Lipschitzian stability of parametric variational inequalities over generalized polyhedra in Banach spaces
- Variational analysis in normed spaces with applications to constrained optimization
- Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
- Optimality conditions for nonlinear infinite programming problems
- Optimality and duality for multiobjective semi-infinite variational problem using higher-order B-type I functions
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Sensitivity analysis for vector equilibrium problems under functional perturbations
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- Composite semi-infinite optimization
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems
- Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Stability analysis for vector quasiequilibrium problems
- Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
- Optimization, Variational Analysis and Applications
- Stability analysis for generalized semi-infinite optimization problems under functional perturbations
- New extremal principles with applications to stochastic and semi-infinite programming
- Stability of semi-infinite vector optimization problems without compact constraints
- Rated extremal principles for finite and infinite systems
- Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization
- Stationarity and regularity of infinite collections of sets
This page was built for publication: Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083308)
