Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods

DOI10.1016/J.NA.2012.12.009zbMath1263.41016OpenAlexW2078633272WikidataQ59241504 ScholiaQ59241504MaRDI QIDQ1937726

Boris S. Mordukhovich, Guoyin Li, Vaithilingam Jeyakumar, Jin-Hua Wang

Publication date: 4 March 2013

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2012.12.009

zbMATH Keywords

dualityrobust optimizationbest approximationsellipsoidal uncertaintynonsmooth Newton methods

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Interpolation in approximation theory (41A05)

Related Items (1)

Robust SOS-convex polynomial optimization problems: exact SDP relaxations

This page was built for publication: Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods