On the primal-duty geometry of level sets in linear and conic optimization

For a conic optimization problem: minimize c*x subject to Ax=b, x in C, we present a geometric relationship between the maximum norms of the level sets of the primal and the inscribed sizes of the level sets of the dual (or the other way around). Keywords: Convex Optimization, Conic Optimization, Duality, Level Sets.

שנה

2018

שפה

English

הוצאה

Creative Media Partners, LLC

מהדורות

1

ISBN

9781377029436

מקור הנתונים: Wikidata