相关论文: The natural ordering cone of a polyhedral convex s…

We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…

Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…

We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone program in a way that preserves fast linear transforms in…

A coarse space $X$, endowed with a linear order compatible with the coarse structure of $X$, is called linearly ordered. We prove that every linearly ordered coarse space $X$ is locally convex and the asymptotic dimension of $X$ is either…

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

We study mapping cones and their dual cones of positive maps of the n by n matrices into itself. For a natural class of cones there is a close relationship between maps in the cone, super-positive maps, and separable states. In particular…

We introduce a natural partial order on the set Cones(d) of rational cones in R^d. The poset NPol(d-1) of normal polytopes in R^{d-1} embeds into Cones(d) via the homogenization map. The order in Cones(d) is conjecturally the inclusion…

Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is…

The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex…

In this study, after given the definition of soft sets and their basic operations we define convex soft sets which is an important concept for operation research, optimization and related problems. Then, we define concave soft sets and give…

Let $C$ be a closed convex subset of a real Hilbert space containing the origin, and assume that $K$ is the homogenization cone of $C$, i.e., the smallest closed convex cone containing $C \times \{1\}$. Homogenization cones play an…

We show that the ordered rings naturally associated to compact convex polyhedra with interior satisfy a positivity property known as order unit cancellation, and obtain other general positivity results as well.

Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the…

The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex heuristics or nicely-behaved non convex…

Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical…

This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…

Solutions of a variational inequality are found by giving conditions for the monotone convergence with respect to a cone of the Picard iteration corresponding to its natural map. One of these conditions is the isotonicity of the projection…

We introduce lexicographic cones, a method of assigning an ordered vector space $\Lex(S)$ to a poset $S$, generalising the standard lexicographic cone. These lexicographic cones are then used to prove that the projective tensor cone of two…

In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…

We define an 'oriented convex region' as a convex region with a direction of symmetry. An earlier article had touched upon isosceles triangles, rectangles and ellipses. Here, we examine some more possible oriented containers - semicircles,…