Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
type: Item
instance of: scholarly article
title: Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
zbMATH Open document ID: 1396.90066
author: Linsong Shen
author: Yanjun Wang
author: Xiaomei Zhang
published in: Mathematical Methods of Operations Research
publication date: 2016-10-20T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6641436
zbMATH Keywords: robust canonical duality-triality
zbMATH Keywords: robust canonical optimality conditions
zbMATH Keywords: nonconvex programming
zbMATH Keywords: data uncertainty
MaRDI profile type: Publication
full work available at URL: s00186-016-0539-z
OpenAlex ID: W2341375409
cites work: Duality in robust optimization: Primal worst equals dual best
cites work: Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications
cites work: Duality principles in nonconvex systems. Theory, methods and applications
cites work: Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
cites work: Perfect duality theory and complete solutions to a class of global optimization problems*
cites work: Canonical duality theory and solutions to constrained nonconvex quadratic programming
cites work: Solutions and optimality criteria to box constrained nonconvex minimization problems
cites work: Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
cites work: Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem
cites work: Geometric nonlinearity: potential energy, complementary energy, and the gap function
cites work: Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
cites work: Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
cites work: Robust duality for generalized convex programming problems under data uncertainty
cites work: Strong Duality in Robust Convex Programming: Complete Characterizations
cites work: Duality theorem and vector saddle point theorem for robust multiobjective optimization problems
cites work: Stochastic programming approach to optimization under uncertainty
DOI: 10.1007/S00186-016-0539-Z
description: scientific article; zbMATH DE number 6641436