Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
From MaRDI portal
Publication:6159528
DOI10.1007/S40324-021-00276-9zbMATH Open1515.90107OpenAlexW3216613706WikidataQ113898579 ScholiaQ113898579MaRDI QIDQ6159528FDOQ6159528
Recommendations
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- scientific article; zbMATH DE number 7238249
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
- Characterizations of robust \(\varepsilon\)-quasi optimal solutions for nonsmooth optimization problems with uncertain data
Cites Work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 7347486 (Why is no real title available?)
- scientific article; zbMATH DE number 7238249 (Why is no real title available?)
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Approximate necessary optimality in fractional semi-infinite multiobjective optimization
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- Approximate solutions of multiobjective optimization problems
- Characterization of norm-based robust solutions in vector optimization
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- Characterizations of robust \(\varepsilon\)-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Higher-order Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- Minimax programming as a tool for studying robust multi-objective optimization problems
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Necessary conditions for ε-optimality
- New extremal principles with applications to stochastic and semi-infinite programming
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- Nonsmooth semi-infinite multiobjective optimization problems
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- On approximate solutions and saddle point theorems for robust convex optimization
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Optimality conditions in convex multiobjective SIP
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Optimization and nonsmooth analysis
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Recent contributions to linear semi-infinite optimization: an update
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Robust linear semi-infinite programming duality under uncertainty
- Robust optimization
- Robustness in nonsmooth nonconvex optimization problems
- Semi-infinite programming
- Theory and applications of robust optimization
- \(\epsilon\)-solutions in vector minimization problems
- \(\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
Cited In (3)
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
- \( \epsilon \)-optimality conditions and \(\epsilon \)-saddle point theorems for robust conical programming problems
This page was built for publication: Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159528)
