Necessary conditions for ε-optimality
From MaRDI portal
Publication:3958294
DOI10.1007/BFb0120986zbMath0494.90085OpenAlexW121895575MaRDI QIDQ3958294
Publication date: 1982
Published in: Optimality and Stability in Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120986
necessary conditionsgeneralized gradientKuhn-Tucker conditionsepsilon-optimalityalmost regular approximate solutionepsilon- semiconvexityepsilon-feasible setepsilon-Lagrangian functionalquasi saddlepoint
Sensitivity, stability, parametric optimization (90C31) Normed linear spaces and Banach spaces; Banach lattices (46B99) Programming in abstract spaces (90C48)
Related Items
\(\varepsilon\)-optimality for multiobjective programming on a Banach space, Approximate weakly efficient solutions of set-valued vector equilibrium problems, On approximate efficiency for nonsmooth robust vector optimization problems, Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits, Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems, A new kind of inner superefficient points, The drop theorem, the petal theorem and Ekeland's variational principle, \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints, Characterizing ϵ-properly efficient solutions, Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity, On quasi \(\epsilon\)-solution for robust convex optimization problems, A new global algorithm for factor-risk-constrained mean-variance portfolio selection, Further results on quasi efficient solutions in multiobjective optimization, On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data, Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data, Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints, Effective algorithms for optimal portfolio deleveraging problem with cross impact, Directional and approximate efficiency in set optimization, Existence and optimality conditions for approximate solutions to vector optimization problems, A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems, Two Types of Approximate Saddle Points, Approximate optimal solutions for multiobjective optimization problems with infinite constraints, \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization, On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems, Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs, On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems, Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty, Unnamed Item, On approximate solutions and saddle point theorems for robust convex optimization, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems, Generalized augmented Lagrangian problem and approximate optimal solutions in nonlinear programming, \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions, e-weak minimal solutions of vector optimization problems with set-valued maps, An inexact spectral bundle method for convex quadratic semidefinite programming, Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions, Unnamed Item, \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming, Sequential optimality conditions for multiobjective fractional programming problems, \(\varepsilon\)-optimality and duality for multiobjective fractional programming, Duality for \(\varepsilon \)-variational inequality, Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications, Optimality conditions in convex optimization with locally Lipschitz constraints, \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints, On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data, Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data, Approximate fixed points and fixed points for multi-valued almost \(E\)-contractions, \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming, On approximate solutions for nonsmooth robust multiobjective optimization problems, Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints, On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems, Necessary optimality conditions and saddle points for approximate optimization in Banach space, Approximately Efficient Solutions in Vector Optimization, \(\epsilon\)-solutions in vector minimization problems, Penalty functions in ε-programming and ε-minimax problems, Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications, Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators, \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming, Generalized \({\varepsilon }\)-quasi solutions of set optimization problems, Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
