Characterizing robust -optimal solution sets for uncertain convex optimization problems
From MaRDI portal
Characterizing robust \(\varepsilon\)-optimal solution sets for uncertain convex optimization problems
Cites work
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- A new approach to characterize the solution set of a pseudoconvex programming problem
- A simple characterization of solutions sets of convex programs
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- Approximate duality
- Approximate solutions of multiobjective optimization problems
- Characterization of solution sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Characterizations of -approximate solutions for robust convex semidefinite programming problems
- Characterizations of optimal solution sets for DC optimization problems in locally convex spaces
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Characterizing robust solution sets of convex programs under data uncertainty
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Convex Analysis
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- On -solutions for convex optimization problems with uncertainty data
- On approximate solutions and saddle point theorems for robust convex optimization
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On characterizing the solution sets of pseudoinvex extremum problems
- On characterizing the solution sets of pseudolinear programs
- Optimization and nonsmooth analysis
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Robust duality in parametric convex optimization
- Robust optimization
- Robust optimization-methodology and applications
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Stable Lagrange dualities for robust conical programming
This page was built for publication: Characterizing robust \(\varepsilon\)-optimal solution sets for uncertain convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7014451)
