Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
DOI10.1007/S00186-016-0539-ZzbMATH Open1396.90066OpenAlexW2341375409MaRDI QIDQ328533FDOQ328533
Xiaomei Zhang, Yanjun Wang, Linsong Shen
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
Recommendations
- Robust duality for generalized convex programming problems under data uncertainty
- Canonical duality for solving nonconvex and nonsmooth optimization problem
- On modeling and global solutions for d.c. optimization problems by canonical duality theory
- On d.c. optimization problems
- Canonical duality for box constrained nonconvex and nonsmooth optimization problems
nonconvex programmingdata uncertaintyrobust canonical duality-trialityrobust canonical optimality conditions
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Duality principles in nonconvex systems. Theory, methods and applications
- Duality in robust optimization: Primal worst equals dual best
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Geometric nonlinearity: potential energy, complementary energy, and the gap function
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Stochastic programming approach to optimization under uncertainty
- Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Duality theorem and vector saddle point theorem for robust multiobjective optimization problems
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Robust duality for generalized convex programming problems under data uncertainty
- Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem
Cited In (1)
This page was built for publication: Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328533)
