Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
From MaRDI portal
Publication:328533
DOI10.1007/s00186-016-0539-zzbMath1396.90066OpenAlexW2341375409MaRDI QIDQ328533
Linsong Shen, Xiao-Mei Zhang, Yan-Jun Wang
Publication date: 20 October 2016
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-016-0539-z
nonconvex programmingdata uncertaintyrobust canonical duality-trialityrobust canonical optimality conditions
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Robust duality for generalized convex programming problems under data uncertainty
- Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem
- Stochastic programming approach to optimization under uncertainty
- Duality in robust optimization: Primal worst equals dual best
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Duality principles in nonconvex systems. Theory, methods and applications
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- DUALITY THEOREM AND VECTOR SADDLE POINT THEOREM FOR ROBUST MULTIOBJECTIVE OPTIMIZATION PROBLEMS
- Geometric nonlinearity: potential energy, complementary energy, and the gap function
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
This page was built for publication: Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
