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

DOI10.1016/J.NA.2012.12.009MaRDI QIDQ1937726zbMATH OpenOpenAlexWikidataFDO

Authors G. Li, Boris S. Mordukhovich, V. Jeyakumar, J. H. 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 optimizationellipsoidal uncertaintybest approximationsnonsmooth Newton methods

Mathematics Subject Classification ID

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

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

Cited in

(4)

• Robust constrained best approximation with nonconvex constraints
• Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
• scientific article; zbMATH DE number 1748554 (Why is no real title available?)
• 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

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