Approximate optimality conditions for nonsmooth optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 2120969 (Why is no real title available?)
- ∊-gradients pour les ponctions localements lipschitziennes et applications
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
- Approximate quasi efficient solutions in multiobjective optimization
- Approximate solutions of multiobjective optimization problems
- Calculus of Dini subdifferentials of functions and contingent coderivatives of set-valued maps
- Concepts on generalized -subdifferentials for minimizing locally Lipschitz continuous functions
- Equivalence among various derivatives and subdifferentials of the distance function.
- Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Necessary conditions for ε-optimality
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Nonsmooth analysis
- Nonsmooth sequential analysis in Asplund spaces
- On AKKT optimality conditions for cone-constrained vector optimization problems
- On global subdifferentials with applications in nonsmooth optimization
- On optimality conditions in nondifferentiable programming
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Optimization and nonsmooth analysis
- Proximal Analysis and Approximate Subdifferentials
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Semistrictly and neatly quasiconvex programming using lower global subdifferentials
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- ε-Subdifferential and ε-monotonicity
Cited in
(1)
This page was built for publication: Approximate optimality conditions for nonsmooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652839)