Approximate optimality conditions for nonsmooth optimization problems

Could not fetch data.

Publication date: 13 December 2024

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

approximate optimality condition \(\varepsilon\)-quasi normal set \(\varepsilon\)-quasi solution \(\varepsilon\)-quasi subdifferential

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation with constraints (41A29)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Approximate solutions of multiobjective optimization problems
\(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
Nonsmooth analysis
Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
\(\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
Equivalence among various derivatives and subdifferentials of the distance function.
An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
On global subdifferentials with applications in nonsmooth optimization
Necessary optimality conditions and saddle points for approximate optimization in Banach space
An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
Calculus of Dini subdifferentials of functions and contingent coderivatives of set-valued maps
Optimization and nonsmooth analysis
Necessary conditions for ε-optimality
ε-Optimal solutions in nondifferentiable convex programming and some related questions
On optimality conditions in nondifferentiable programming
ε-Subdifferential and ε-monotonicity
_∊-gradients pour les ponctions localements lipschitziennes et applications
Nonsmooth sequential analysis in Asplund spaces
On AKKT optimality conditions for cone-constrained vector optimization problems
Proximal Analysis and Approximate Subdifferentials
Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
Semistrictly and neatly quasiconvex programming using lower global subdifferentials

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)