Related papers: Optimizing convex functions over nonconvex sets
A linear functional of an object from a convex symmetric set can be optimally estimated, in a worst-case sense, by a linear functional of observations made on the object. This well-known fact is extended here to a nonlinear setting: other…
This paper discusses a special kind of convex constrained optimization problem, whose constraints consist of box inequalities and linear equalities. For this problem, in addition to general optimization algorithms such as exact penalty…
We introduce the class of functions positively associated with a linear operator. We describe these classes for several integral operators including the $q$-cosine transform and the spherical Radon transform. We show that positively…
We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…
The goal of this paper is to derive new classes of valid convex inequalities for quadratically constrained quadratic programs (QCQPs) through the technique of lifting. Our first main result shows that, for sets described by one bipartite…
In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of…
We study the expressibility and learnability of convex optimization solution functions and their multi-layer architectural extension. The main results are: \emph{(1)} the class of solution functions of linear programming (LP) and quadratic…
In this paper, the authors establish a new type integral inequalities for differentiable s-convex functions in the second sense. By the well-known H\"older inequality and power mean inequality, they obtain some integral inequalities related…
In this paper, we not only give the extensions of the results given in [7] by Gill et al. for log-convex functions, but also obtain some new Hadamard type inequalities for log-convex, m-convex and (alpha,m)-convex functions.
We distinguish two kinds of piecewise linear functions and provide an interesting representation for a piecewise linear function between two normed spaces. Based on such a representation, we study a fully piecewise linear vector…
Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study sufficient conditions for a convex hull result that immediately implies that…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
We establish sharp forms of Young's convolution inequality and its reverse on the discrete hypercube $\{0,1\}^d$ in the diagonal case $p=q$. As applications, we derive bounds for additive energies and sumsets. We also investigate the…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. Some results related to stable states/vectors, anti-stable states/vectors (over the…
We consider an $n$-variate monomial function that is restricted both in value by lower and upper bounds and in domain by two homogeneous linear inequalities. Such functions are building blocks of several problems found in practical…
We consider quadratic optimization in variables $(x,y)$ where $0\le x\le y$, and $y\in\{0,1\}^n$. Such binary $y$ are commonly refered to as "indicator" or "switching" variables and occur commonly in applications. One approach to such…
Linear models have shown great effectiveness and flexibility in many fields such as machine learning, signal processing and statistics. They can represent rich spaces of functions while preserving the convexity of the optimization problems…
Consider the closed convex hull $K$ of a monomial curve given parametrically as $(t^{m_1},\ldots,t^{m_n})$, with the parameter $t$ varying in an interval $I$. We show, using constructive arguments, that $K$ admits a lifted semidefinite…
The Wills functional $\mathcal{W}(K)$ of a convex body $K$, defined as the sum of its intrinsic volumes $\mathrm{V}_i(K)$, turns out to have many interesting applications and properties. In this paper we make profit of the fact that it can…
In this paper, an integral identity for twice differentiable functions is generalized. Then, by using convexity of |f''| or q-th power of |f''| and with the aid of power mean and Holder's inequalities we achieved some new results. We also…