The problem of minimizing $${\tilde f=f+p}$$ over some convex subset of a Euclidean space is investigated, where f(x) = x T Ax + b T x is strictly convex and |p| is only assumed to be bounded by some positive number s. It is shown that the function $${\tilde f}$$ is strictly outer γ-convex...

The problem of minimizing <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\tilde f=f+p}$$</EquationSource> </InlineEquation> over some convex subset of a Euclidean space is investigated, where f(x) = x <Superscript> T </Superscript> Ax + b <Superscript> T </Superscript> x is strictly convex and |p| is only assumed to be bounded by some positive number s. It is shown that the function <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${\tilde f}$$</EquationSource> </InlineEquation> is strictly outer...</equationsource></inlineequation></superscript></superscript></equationsource></inlineequation>