Efficiency conditions for nonconvex mathematical programming problems via weak subdifferentials
From MaRDI portal
Cites work
- A New Approach to Lagrange Multipliers
- Abstract convexity and global optimization
- Calculus of Dini subdifferentials of functions and contingent coderivatives of set-valued maps
- Convex Analysis
- First order optimality conditions in vector optimization involving stable functions
- Higher-order efficiency conditions for constrained vector equilibrium problems
- scientific article; zbMATH DE number 5617354 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Lagrange Multipliers and Optimality
- Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems
- Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization
- New second-order optimality conditions for vector equilibrium problems with constraints in terms of contingent derivatives
- On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
- Optimality conditions in nonconvex optimization via weak subdifferentials
- Optimization and nonsmooth analysis
- Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- Scalarization and optimality conditions for vector equilibrium problems
- Some notes on weak subdifferential
- Some properties of second-order weak subdifferentials
- Stability and duality of nonconvex problems via augmented Lagrangian
This page was built for publication: Efficiency conditions for nonconvex mathematical programming problems via weak subdifferentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021285)
