Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data
From MaRDI portal
Publication:4986407
DOI10.1080/02331934.2021.1871730OpenAlexW3121186615MaRDI QIDQ4986407
Xian-Jun Long, Xiang-Kai Sun, Kok Lay Teo
Publication date: 27 April 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1871730
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)
Related Items (7)
Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications ⋮ Robust strong duality for nonconvex optimization problem under data uncertainty in constraint ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ Characterizations of multi-objective robustness solutions defined by Minkowski set difference ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ Krasnoselski-Mann-type inertial method for solving split generalized mixed equilibrium and hierarchical fixed point problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate solutions of multiobjective optimization problems
- Bi-objective robust optimisation
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Robust duality in parametric convex optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Conjugate duality in convex optimization
- \(\epsilon\)-solutions in vector minimization problems
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizations for optimality conditions of general robust optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- A unified characterization of multiobjective robustness via separation
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- On approximate solutions and saddle point theorems for robust convex optimization
- Recent advances in robust optimization: an overview
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- A unified approach through image space analysis to robustness in uncertain optimization problems
- 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
- \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- Robust multiobjective optimization \& applications in portfolio optimization
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
- Theory and Applications of Robust Optimization
- Two Types of Approximate Saddle Points
- Optimization and nonsmooth analysis
- Necessary conditions for ε-optimality
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
This page was built for publication: Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data
