Functions with strictly convex epigraph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global infimum of strictly convex quadratic functions with bounded perturbations

The problem of minimizing f̃ = f +p over some convex subset of a Euclidean space is investigated, where f(x) = x Ax + b x is a strictly convex quadratic function and |p| is only assumed to be bounded by some positive number s. It is shown that the function f̃ is strictly outer γ-convex for any γ > γ∗, where γ∗ is determined by s and the smallest eigenvalue of A. As consequence, a γ∗-local minimal...

متن کامل

Epigraph projections for fast general convex programming

This paper develops an approach for efficiently solving general convex optimization problems specified as disciplined convex programs (DCP), a common general-purpose modeling framework. Specifically we develop an algorithm based upon fast epigraph projections, projections onto the epigraph of a convex function, an approach closely linked to proximal operator methods. We show that by using these...

متن کامل

Epigraph proximal algorithms for general convex programming

This work aims at partially bridging the gap between (generic but slow) “generalpurpose” convex solvers and (fast but constricted) “specialized” solvers. We develop the Epsilon system, a solver capable of handling general convex problems (inputs are specified directly as disciplined convex programs); however, instead of transforming these problems to cone form, the compiler transforms them to a...

متن کامل

Some properties of boundedly perturbed strictly convex quadratic functions

We investigate the problem (P̃ ) of minimizing f̃(x) := f(x) + p(x) subject to x ∈ D, where f(x) := x Ax + b x, A is a symmetric positive definite n-by-n matrix, b ∈ R, D ⊂ R is convex, and p : R → R satisfies supx∈D |p(x)| ≤ s for some given s < +∞. p is called perturbation, but it may describe some errors caused by modeling, measurement, approximation and calculation. We prove that the strict c...

متن کامل

Strictly Convex Corners Scatter

We prove the absence of non-scattering energies for potentials in the plane having a corner of angle smaller than π. This extends the earlier result of Bl̊asten, Päivärinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential with a circular conic corner whose opening angle is outside a countable subset of (0, π).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Inequalities & Applications

سال: 2018

ISSN: 1331-4343

DOI: 10.7153/mia-2018-21-57