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
Authors: Thanh-Hung Pham 
Publication date: 20 June 2023
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40324-021-00276-9
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
robust optimizationsemi-infinite programmingClarke subdifferentialapproximate optimality conditionapproximate duality
Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)
Cites Work
- Theory and applications of robust optimization
- Robust optimization
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- \(\epsilon\)-solutions in vector minimization problems
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Approximate solutions of multiobjective optimization problems
- Title not available (Why is that?)
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Semi-infinite programming
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- Nonsmooth semi-infinite multiobjective optimization problems
- Necessary conditions for ε-optimality
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- Robust linear semi-infinite programming duality under uncertainty
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- Recent contributions to linear semi-infinite optimization: an update
- 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
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Robustness in nonsmooth nonconvex optimization problems
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Nondifferentiable fractional semi-infinite 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
- Optimality conditions in convex multiobjective SIP
- On approximate solutions and saddle point theorems for robust convex optimization
- Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Title not available (Why is that?)
- New extremal principles with applications to stochastic and semi-infinite programming
- On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions
- Title not available (Why is that?)
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Minimax programming as a tool for studying robust multi-objective optimization problems
- Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- Title not available (Why is that?)
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)
