Necessary conditions for weak sharp minima in cone-constrained optimization problems
From MaRDI portal
Summary: We study weak sharp minima for optimization problems with cone constraints. Some necessary conditions for weak sharp minima of higher order are established by means of upper Studniarski or Dini directional derivatives. In particular, when the objective and constrained functions are strict derivative, a necessary condition is obtained by a normal cone.
Recommendations
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Necessary optimality conditions for weak sharp minima in set-valued optimization
- Generalized weak sharp minima in cone-constrained convex optimization with applications
- scientific article; zbMATH DE number 1304154
- Weak sharp efficiency for constrained vector equilibrium problems
Cites work
- A Gauss-Newton Approach to Solving Generalized Inequalities
- A subdifferential condition for calmness of multifunctions
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Higher-order necessary and sufficient conditions for strict local pareto minima in terms of Studniarski's derivatives
- scientific article; zbMATH DE number 17952 (Why is no real title available?)
- scientific article; zbMATH DE number 1304154 (Why is no real title available?)
- scientific article; zbMATH DE number 1328979 (Why is no real title available?)
- scientific article; zbMATH DE number 597939 (Why is no real title available?)
- Iterative linear programming solution of convex programs
- On weak sharp minima for a special class of nonsmooth functions
- Optimization and nonsmooth analysis
- Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
- Sharp minima for multiobjective optimization in Banach spaces
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Minima in Multicriteria Linear Programming
- Weak sharp minima revisited. I: Basic theory
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- Weak Sharp Minima: Characterizations and Sufficient Conditions
Cited in
(9)- Generalized weak sharp minima in cone-constrained convex optimization with applications
- Simulated annealing-based krill herd algorithm for global optimization
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- Nonconvex weak sharp minima on Riemannian manifolds
- A novel hybrid bat algorithm with harmony search for global numerical optimization
- Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds
- Generalized weak sharp minima and the existence of strong Lagrangian multipliers in conic convex optimization
- Weak Sharp Minima: Characterizations and Sufficient Conditions
- Necessary optimality conditions for weak sharp minima in set-valued optimization
This page was built for publication: Necessary conditions for weak sharp minima in cone-constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417222)
