Robust strong duality for nonconvex optimization problem under data uncertainty in constraint

DOI10.3934/math.2021713OpenAlexW3198445328MaRDI QIDQ2142822

Yan-Fei Chai

Publication date: 30 May 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2021713

zbMATH Keywords

robust strong dualityrobust abstract perturbational weak conjugate dualitythe inequalityweak conjugate function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of robust optimal solutions for uncertain convex optimization problems
• Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
• Robust duality in parametric convex optimization
• Robust conjugate duality for convex optimization under uncertainty with application to data classification
• Robust duality for generalized convex programming problems under data uncertainty
• Duality for nonsmooth semi-infinite programming problems
• Robust linear optimization under general norms.
• Selected topics in robust convex optimization
• Duality in robust optimization: Primal worst equals dual best
• Complete characterizations of robust strong duality for robust vector optimization problems
• On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
• Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
• On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
• New Farkas-type results for vector-valued functions: a non-abstract approach
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
• Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
• A Nonlinear Lagrangian Approach to Constrained Optimization Problems
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Constructing Uncertainty Sets for Robust Linear Optimization
• Abstract Convexity and Augmented Lagrangians
• An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
• Variational Analysis
• Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data
• Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
• A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems
• Abstract convexity and global optimization
• Nonlinear Lagrangian theory for nonconvex optimization.
• Optimality and duality for robust multiobjective optimization problems

This page was built for publication: Robust strong duality for nonconvex optimization problem under data uncertainty in constraint