Some characterizations of approximate solutions for robust semi-infinite optimization problems

DOI10.1007/S10957-021-01938-4zbMath1480.90186OpenAlexW3202371139MaRDI QIDQ2664903

Xian-Jun Long, Xiang-Kai Sun, Kok Lay Teo

Publication date: 18 November 2021

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-021-01938-4

zbMATH Keywords

scalarizationsemi-infinite optimizationapproximate efficient solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Robustness in mathematical programming (90C17)

Related Items (15)

Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ Self-adaptive subgradient extragradient-type methods for solving variational inequalities ⋮ Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ Robust duality for robust efficient solutions in uncertain vector optimization problems ⋮ Existence results and equilibrium stability conditions to fuzzy \(n\)-player generalized multiobjective games with application to economic equilibrium models ⋮ On second-order conic programming duals for robust convex quadratic optimization problems ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Optimality and duality for nonconvex fuzzy optimization using granular differentiability method ⋮ Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules ⋮ Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate solutions of multiobjective optimization problems
• \(\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
• Local and global optimality conditions for dc infinite optimization problems
• On the stability of solutions for semi-infinite vector optimization problems
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
• Characterizations for optimality conditions of general robust optimization problems
• A unified characterization of multiobjective robustness via separation
• Robust optimization-methodology and applications
• An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
• Robust optimization and data classification for characterization of Huntington disease onset via duality methods
• On approximate solutions and saddle point theorems for robust convex optimization
• Recent advances in robust optimization: an overview
• Radius of robust feasibility of system of convex inequalities with uncertain data
• 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
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• Robust multiobjective optimization \& applications in portfolio optimization
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Optimization and nonsmooth analysis
• ϵ-Efficient solutions in semi-infinite multiobjective optimization
• Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
• 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
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

This page was built for publication: Some characterizations of approximate solutions for robust semi-infinite optimization problems