Convex optimisation constitutes a fundamental area in applied mathematics where the objective is to identify the minimum of a convex function subject to a set of convex constraints. This framework ...
CONVEXITY OF LEVEL SETS FOR ELLIPTIC PROBLEMS IN CONVEX DOMAINS OR CONVEX RINGS: TWO COUNTEREXAMPLES
American Journal of Mathematics, Vol. 138, No. 2 (April 2016), pp. 499-527 (29 pages) This paper deals with some geometrical properties of solutions of some semilinear elliptic equations in bounded ...
This is a preview. Log in through your library . Abstract Duality theorems previously obtained for certain convex problems in the calculus of variations are applied to the study of the behavior of ...
where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results