Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
From MaRDI portal
Publication:2037900
DOI10.1007/s11590-019-01457-2zbMath1471.90154OpenAlexW2965935604MaRDI QIDQ2037900
Do Sang Kim, Liguo Jiao, Yu Ying Zhou
Publication date: 8 July 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01457-2
optimality conditionsdualitysemi-infinite programminglimiting constraint qualificationquasi \(\epsilon\)-solutions
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Related Items (7)
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 ⋮ On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems ⋮ A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate solutions of multiobjective optimization problems
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Recent contributions to linear semi-infinite optimization
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- Recent contributions to linear semi-infinite optimization: an update
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- On the variational principle
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Nonsmooth semi-infinite multiobjective optimization problems
- Optimality conditions in convex optimization with locally Lipschitz constraints
- Existence of augmented Lagrange multipliers for semi-infinite programming problems
- Approximate KKT points and a proximity measure for termination
- Subdifferentials of Marginal Functions in Semi-infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Variational Analysis and Applications
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
