Related papers: Convex and linear models of NP-problems
We introduce the M-representation of polytopes, which makes it possible to compute linear transformations, convex hulls, and Minkowski sums with linear complexity in the dimension of the polytopes. When the polytope is a convex hull of a…
In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…
Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…
In this paper, we consider the multiplicity of solutions for a class of Kirchhoff type problems with sub-linear and critical terms on an unbounded domain. With the aid of Ekeland's variational principle and the concentration compactness…
We present lifted linear relaxations of the OPF problem.
We discuss some key results from convex analysis in the setting of topological groups and monoids. These include separation theorems, Krein-Milman type theorems, and minimax theorems.
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
Generalized polyhedral convex optimization problems in locally convex Hausdorff topological vector spaces are studied systematically in this paper. We establish solution existence theorems, necessary and sufficient optimality conditions,…
We present a numerical method for the solution of Newton's problem of least resistance in the class of convex functions using a convex hull approach. We observe that the numerically computed solutions possess some symmetry. Further, their…
I survey problems concerning Lindelof spaces which have partial set- theoretic solutions.
Inhomogeneous Kirchhoff type equations with indefinite data are considered. Some necessary and sufficient conditions for the existence of positive solutions of the problem under consideration are presented.
We claim to resolve the P=?NP problem via a formal argument for P=NP.
The Birkhoff polytope, defined to be the convex hull of $n\times n$ permutation matrices, is a well studied polytope in the context of the Ehrhart theory. This polytope is known to have many desirable properties, such as the Gorenstein…
We propose that the LP-Newton method can be used to solve conic LPs over a conic box, whenever linear optimization over an otherwise unconstrained conic box is easy. In particular, if $\leq_\mathcal{K}$ is the partial order induced by a…
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.
In optimal transport, quadratic regularization is a sparse alternative to entropic regularization: the solution measure tends to have small support. Computational experience suggests that the support decreases monotonically to the…
A new result in convex analysis on the calculation of proximity operators in certain scaled norms is derived. We describe efficient implementations of the proximity calculation for a useful class of functions; the implementations exploit…
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…
We study the norm derivatives in the context of Birkhoff-James orthogonality in real Banach spaces. As an application of this, we obtain a complete characterization of the left-symmetric points and the right-symmetric points in a real…
The polytope containment problem is deciding whether a polytope is a contained within another polytope. This problem is rooted in computational convexity, and arises in applications such as verification and control of dynamical systems. The…