Related papers: Convex and linear models of NP-problems

We consider multiple polylogarithms in a single variable at non-positive integers. Defining a connected graded Hopf algebra, we apply Connes' and Kreimer's algebraic Birkhoff decomposition to renormalize multiple polylogarithms at…

We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…

We give a detailed technical report on the implementation of the algorithm presented in Gravin et al. (Discrete & Computational Geometry'12) for reconstructing an $N$-vertex convex polytope $P$ in $\mathbb{R}^d$ from the knowledge of…

This work is concerned with linear inverse problems where a distributed parameter is known a priori to only take on values from a given discrete set. This property can be promoted in Tikhonov regularization with the aid of a suitable convex…

This paper aims to find efficient solutions to a multi-objective optimization problem (MP) with convex polynomial data. To this end, a hybrid method, which allows us to transform problem (MP) into a scalar convex polynomial optimization…

Notions of the orthogonality and convolution orthogonality are explored with the use of the Kontorovich-Lebedev transform and its convolution. New classes of the corresponding orthogonal polynomials and functions are investigated. Integral…

We exhibit a class of classical or tropical posynomial systems which can be solved by reduction to linear or convex programming problems. This relies on a notion of colorful vectors with respect to a collection of Newton polytopes. This…

Let $P$ be a planar set of $n$ points in general position. We consider the problem of computing an orientation of the plane for which the Rectilinear Convex Hull of $P$ has minimum area. Bae et al. (Computational Geometry: Theory and…

A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…

We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…

The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…

We study translative integral formulas for certain translation invariant functionals on convex polytopes and discuss local extensions and applications to Poisson processes and Boolean models.

We prove the $W^{1,2}_p$-estimate and solvability for the Dirichlet problem of second-order parabolic equations in simple convex polytopes with time irregular coefficients, when $p\in (1,2]$. We also consider the corresponding Neumann…

In this note, we prove that below the first critical energy level, a proper combination of the Ligon-Schaaf and Levi-Civita regularization mappings provides a convex symplectic embedding of the energy surfaces of the planar rotating Kepler…

An inexact Newton type method for numerical minimization of convex piecewise quadratic functions is considered and its convergence is analyzed. Earlier, a similar method was successfully applied to optimizaton problems arising in numerical…

Differential equations with convective terms such as the Burger's equation appear in many applications and have been the subject of intense research. In this paper we use a generalized form of Cole-Hopf transformation to relate the…

Starting with a finite-dimensional complex Lie algebra, we extend scalars using suitable commutative topological algebras. We study Birkhoff decompositions for the corresponding loop groups. Some results remain valid for loop groups with…

In this paper, we study some optimization problems in uniformly convex and uniformly smooth Bochner spaces. We consider four cases of the underlying subsets: closed and convex subsets, closed and convex cones, closed subspaces and closed…

This paper considers the inversion of ill-posed linear operators. To regularise the problem the solution is enforced to lie in a non-convex subset. Theoretical properties for the stable inversion are derived and an iterative algorithm akin…

A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…