Skip to search formSkip to main contentSkip to account menu

Strong duality

Strong duality is a concept in optimization such that the primal and dual solutions are equivalent. This is as opposed to weak duality (the primal… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Given a non-convex function $f(x)$ that is an average of $n$ smooth functions, we design stochastic first-order methods to find… 
2014
2014
In this paper we consider the set of polynomials which are nonnegative over a subset of the nonnegative orthant, where this… 
2013
2013
We study non-convex quadratic minimization problems under (possibly non-convex) quadratic and linear constraints, and… 
2012
2012
Due to the development of new technologies (digital cameras, smart phones, new data formats, etc.) people are led to deal with an… 
2011
2011
Considering a general vector optimization problem, we attach to it by means of perturbation theory new vector duals. When the… 
2009
2009
Hybrid theories arise out of the combination of ontologies with nonmonotonic rules and are receiving increasing attention in KR… 
2008
2008
We show that an integral domain R is a strong Mori domain if and only if any direct sum of co-semi-divisorial injective R-modules… 
Review
2003
Review
2003
Foreword. Preface. About the Company-Rath & Strong: A Distinguished History. Acknowledgments. Introduction. What Is Six Sigma… 
2003
2003
We prove that every M-ideal is strongly proximinal and that, for any Banach space X, K(X;c0) is an M-ideal in L(X;' 1 ). 
1996
1996
Postponement of K-contractions and the conservation theorem do not hold for ordinary but have been established by de Groote for a…