On quasi -solution for robust convex optimization problems
From MaRDI portal
Publication:1686550
DOI10.1007/S11590-016-1067-8zbMATH Open1410.90155OpenAlexW2485130085MaRDI QIDQ1686550FDOQ1686550
Publication date: 15 December 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1067-8
robust convex optimization problemapproximate optimality conditionsapproximate duality theoremsquasi \(\epsilon\)-solution
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- Title not available (Why is that?)
- Variational Analysis
- Convex Analysis
- On the variational principle
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizations of solution sets of convex vector minimization problems
- Approximate solutions of multiobjective optimization problems
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Strong Duality in Robust Convex Programming: Complete Characterizations
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Selected topics in robust convex optimization
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Necessary conditions for Ξ΅-optimality
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Approximate KKT points and a proximity measure for termination
Cited In (25)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On approximate solutions for robust convex semidefinite optimization problems
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- Optimality and duality for robust optimization problems involving intersection of closed sets
- Characterizations of robustΞ΅-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Optimality conditions in convex optimization with locally Lipschitz constraints
- Title not available (Why is that?)
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
- SDP reformulation for robust optimization problems based on nonconvex QP duality
- Convexity and closedness in stable robust duality
- Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems
- On approximate solutions and saddle point theorems for robust convex optimization
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
Recommendations
- Title not available (Why is that?) π π
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems π π
- On approximate solutions for robust convex semidefinite optimization problems π π
- On approximate solutions and saddle point theorems for robust convex optimization π π
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs π π
- Characterizations of robustΞ΅-quasi optimal solutions for nonsmooth optimization problems with uncertain data π π
- Robust convex quadratically constrained programs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- A robustification approach in unconstrained quadratic optimization π π
This page was built for publication: On quasi \(\epsilon\)-solution for robust convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686550)
