On the continuity of the optimal set mapping of a convex programming problem

From MaRDI portal
Publication:2563367





The authors prove the Hausdorff continuity of the optimal mapping (as a function of the right hand sides) of the convex programming problem, in which the constraints are given by convex polynomials of degree \(\leq 4\), and the objective function is convex and weak analytic (including all the polynomials of arbitrary degree).











This page was built for publication: On the continuity of the optimal set mapping of a convex programming problem

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