Strong Fermat rules for constrained set-valued optimization problems on Banach spaces
From MaRDI portal
Recommendations
- On some Fermat rules for set-valued optimization problems
- The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings
- The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives
- GENERALIZED SET-VALVED STRONGLY NONLINEAR VARIATIONAL INEQUALITIES IN BANACH SPACES
- Extended and strongly extended well-posedness of set-valued optimization problems
- Strong convergence theorems for variational inequality problems and fixed point problems in Banach spaces
- Strong convergence theorems for variational inequalities and fixed point problems in Banach spaces
- Lagrange multiplier rules for weakly minimal solutions of compact-valued set optimization problems
- scientific article; zbMATH DE number 2047425
- Higher-order optimality conditions for strict and weak efficient solutions in set-valued optimization
Cites work
- A Gauss-Newton Approach to Solving Generalized Inequalities
- A unified separation theorem for closed sets in a Banach space and optimality conditions for vector optimization
- Characterizations of Error Bounds for Convex Multifunctions on Banach Spaces
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- Error Bounds for Abstract Linear Inequality Systems
- Error bounds for lower semicontinuous functions in normed spaces
- Error bounds in mathematical programming
- Error bounds: necessary and sufficient conditions
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Generalized equations and their solutions, Part I: Basic theory
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Global error bounds for \(\gamma \)-paraconvex multifunctions
- Higher-order optimality conditions for set-valued optimization
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 3760850 (Why is no real title available?)
- scientific article; zbMATH DE number 3574390 (Why is no real title available?)
- scientific article; zbMATH DE number 1328979 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 823375 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Local differentiability of distance functions
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Metric regularity of mappings and generalized normals to set images
- Metric subregularity and calmness for nonconvex generalized equations in Banach spaces
- Metric Subregularity and Constraint Qualifications for Convex Generalized Equations in Banach Spaces
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Necessary optimality conditions for weak sharp minima in set-valued optimization
- New second-order directional derivative and optimality conditions in scalar and vector optimization
- On error bounds for lower semicontinuous functions.
- On some Fermat rules for set-valued optimization problems
- On the Clarke subdifferential of the distance function of a closed set
- Optimality conditions for maximizations of set-valued functions
- Optimization and nonsmooth analysis
- Second-Order Conditions for Optimization Problems with Constraints
- Second-order optimality conditions for strict efficiency of constrained set-valued optimization
- Second-order optimality conditions in set optimization
- Set-valued analysis
- Sharp minima for multiobjective optimization in Banach spaces
- Strict efficiency in set-valued optimization
- Strict efficiency in vector optimization
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Subsmooth sets: Functional characterizations and related concepts
- The Fermat rule for multifunctions for super efficiency
- The Fermat rule for multifunctions on Banach spaces
- Weak sharp efficiency and growth condition for vector-valued functions with applications
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Minima in Multicriteria Linear Programming
- Weak sharp minima in multiobjective optimization
- Weak sharp minima revisited. I: Basic theory
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- Weak Sharp Solutions of Variational Inequalities
- Weak Sharp Solutions of Variational Inequalities in Hilbert Spaces
Cited in
(9)- Strict directional solutions in vectorial problems: necessary optimality conditions
- Existence of pseudo-relative sharp minimizers in set-valued optimization
- The Fermat rule for multifunctions on Banach spaces
- The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives
- On some Fermat rules for set-valued optimization problems
- Sharp efficiency for vector equilibrium problems on Banach spaces
- Optimality conditions for sharp minimality of order \(\gamma\) in set-valued optimization
- The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings
- Existence theorems of quasi-relative sharp minima in set-valued optimization
This page was built for publication: Strong Fermat rules for constrained set-valued optimization problems on Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928759)
