On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
DOI10.1007/s11117-022-00952-8OpenAlexW4307927247MaRDI QIDQ2091085
Amira Achouak Oulha, Baha M. Alzalg
Publication date: 31 October 2022
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-022-00952-8
multi-objective programmingsemi-infinite programmingJordan algebraapproximate optimality conditionsapproximate duality theoremscone of squaresrobust symmetric cone optimization
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15) Semi-infinite programming (90C34) Applications of Jordan algebras to physics, etc. (17C90) Robustness in mathematical programming (90C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\epsilon\)-solutions for robust fractional optimization problems
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Robust linear semi-infinite programming duality under uncertainty
- Stochastic second-order cone programming: applications models
- Robust linear optimization under general norms.
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
- Robust convex quadratically constrained programs
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- On approximate solutions for robust convex semidefinite optimization problems
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Epsilon approximate solutions for multiobjective programming problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems
- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
- An infeasible interior-point algorithm for stochastic second-order cone optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- Characterizations of solution sets of convex vector minimization problems
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming
- Semidefinite optimization
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Semidefinite Programming
- Strong duality in robust semi-definite linear programming under data uncertainty
This page was built for publication: On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
