Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
DOI10.3934/naco.2021053zbMath1479.90169OpenAlexW3212056054WikidataQ113692634 ScholiaQ113692634MaRDI QIDQ2074630
Jutamas Kerdkaew, Rattanaporn Wangkeeree, Rabian Wangkeeree
Publication date: 10 February 2022
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2021053
sufficient optimality conditionsstrong dualityunderestimatorsbiconjugate functionsrobust KKT conditionsrobust optimization problems
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Robust duality in parametric convex optimization
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
- Duality in robust optimization: Primal worst equals dual best
- New sufficiency for global optimality and duality of mathematical programming problems via underestimators
- On sufficiency of the Kuhn-Tucker conditions
- A generalization of the Kuhn-Tucker sufficiency conditions
- Handbook of global optimization. Vol. 2
- Characterizations of robust solution set of convex programs with uncertain data
- Robust optimization-methodology and applications
- Deterministic global optimization. Theory, methods and applications
- Characterizing robust solution sets of convex programs under data uncertainty
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- Robust Convex Optimization
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Theory and Applications of Robust Optimization
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
- Optimization with generalized invexity
- When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f?
- On generalised convex mathematical programming
- Nonlinear Programming
This page was built for publication: Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
