Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
From MaRDI portal
Recommendations
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- scientific article; zbMATH DE number 7238249
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- On weighted robust approximate solutions for semi-infinite optimization with uncertain data
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 7238249 (Why is no real title available?)
- A unified characterization of multiobjective robustness via separation
- A unifying approach to robust convex infinite optimization duality
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- Bi-level strategies in semi-infinite programming.
- Characterizations for optimality conditions of general robust optimization problems
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Convex Analysis
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Necessary conditions for ε-optimality
- Nonsmooth semi-infinite multiobjective optimization problems
- On -solutions for convex optimization problems with uncertainty data
- 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 optimality theorems for robust optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On the stability of solutions for semi-infinite vector optimization problems
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Optimization and nonsmooth analysis
- Recent advances in robust optimization: an overview
- Recent contributions to linear semi-infinite optimization: an update
- Robust linear semi-infinite programming duality under uncertainty
- Robust multiobjective optimization with application to Internet routing
- Robust optimization
- Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty
- Semi-infinite programming
- Stable Lagrange dualities for robust conical programming
- Theory and applications of robust optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- -optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- \(\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
(34)- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- A reduced Jacobian method with full convergence property
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- Globalized Robust Optimization for Nonlinear Uncertain Inequalities
- Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications
- Robust optimality conditions for semi-infinite equilibrium problems involving data uncertainty
- Approximate optimality conditions and duality results for non-smooth semi-infinite programming problems
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
- Robust saddle‐point criterion in second‐order partial differential equation and partial differential inequation constrained control problems
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- \(\chi\)-optimal solution of single objective nonlinear optimization problem with uncertain parameters
- Characterizing robust -optimal solution sets for uncertain convex optimization problems
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint
- scientific article; zbMATH DE number 7238249 (Why is no real title available?)
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
- Some results of Karush-Kuhn-Tucker multipliers in robust semi-infinite multiobjective optimization
- On Chankong-Haimes scheme for approximate optimality conditions of nonsmooth fractional multiobjective optimization problems with infinite constraints
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Tractable approximation to robust nonlinear production frontier problem
- On second-order conic programming duals for robust convex quadratic optimization problems
- Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
- Higher-order tangent epiderivatives and applications to duality in set-valued optimization
- An inexact bundle method for semi-infinite minimax problems
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- 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
- -quasi-weakly solution for semi-infinite vector optimization problems with data uncertainty
- Semi-infinite vanishing constraints problem with convexificators and optimality analysis
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
This page was built for publication: Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121777)
