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

DOI10.1016/J.NA.2012.12.009zbMATH Open1263.41016OpenAlexW2078633272WikidataQ59241504 ScholiaQ59241504MaRDI QIDQ1937726FDOQ1937726

Boris S. Mordukhovich, V. Jeyakumar, J. H. Wang, G. Li

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

Recommendations

• Robust constrained best approximation with nonconvex constraints
• Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
• Some theoretical aspects of Newton's method for constrained best interpolation
• Robust duality in parametric convex optimization
• On highly robust approximate solutions for nonsmooth convex optimizations with data uncertainty

zbMATH Keywords

dualityrobust optimizationellipsoidal uncertaintybest approximationsnonsmooth Newton methods

Mathematics Subject Classification ID

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

Cited In (2)

• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937726)