A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems

DOI10.23952/jnva.7.2023.6.01OpenAlexW4389705551MaRDI QIDQ6187726

Zhe Hong, Do Sang Kim, Kwan Deok Bae, Guang-Ri Piao

Publication date: 15 January 2024

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.23952/jnva.7.2023.6.01

zbMATH Keywords

robust optimization approximate optimality conditions robust characteristic cone constraint qualification $\varepsilon$-normal set generalized approximate solutions

Mathematics Subject Classification ID

Operator theory (47-XX) Functional analysis (46-XX)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On $\epsilon$-solutions for convex optimization problems with uncertainty data
Robust conjugate duality for convex optimization under uncertainty with application to data classification
Selected topics in robust convex optimization
Duality in robust optimization: Primal worst equals dual best
$\varepsilon $-optimality and $\varepsilon $-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
On quasi $\epsilon$-solution for robust convex optimization problems
Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
On the variational principle
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 approximate solutions and saddle point theorems for robust convex optimization
On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
Strong Duality in Robust Convex Programming: Complete Characterizations
Necessary conditions for ε-optimality
ε-Optimal solutions in nondifferentiable convex programming and some related questions
On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
Convex Analysis
Optimality and duality for robust multiobjective optimization problems

This page was built for publication: A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems