相关论文: Convex and linear models of NP-problems

The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained…

These lecture notes for a graduate class present the regularization theory for linear and nonlinear ill-posed operator equations in Hilbert spaces. Covered are the general framework of regularization methods and their analysis via spectral…

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a…

This paper is concerned with the numerical solution of nonlinear ill-posed operator equations involving convex constraints. We study a Newton-type method which consists in applying linear Tikhonov regularization with convex constraints to…

First, we obtain a new formula for Bremermann type upper envelopes, that arise frequently in convex analysis and pluripotential theory, in terms of the Legendre transform of the convex- or plurisubharmonic-envelope of the boundary data.…

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…

Any square matrix can be transformed into a doubly stochastic matrix via Sinkhorn scaling with diagonal matrices or completing to a larger dimensional matrix. Standard Birkhoff-von Neumann and Pauli decompositions represent such matrices as…

We prove the well posedness in weighted Sobolev spaces of certain linear and nonlinear elliptic boundary value problems posed on convex domains and under singular forcing. It is assumed that the weights belong to the Muckenhoupt class $A_p$…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

We study the enclosure method for the p-Calder\'on problem, which is a nonlinear generalization of the inverse conductivity problem due to Calder\'on that involves the p-Laplace equation. The method allows one to reconstruct the convex hull…

Particular solutions of the Benney equations are constructed. Their properties are discussed.

In this paper some open problems for Painlev\'e equations are discussed. In particular the following open problems are described: (i) the Painlev\'e equivalence problem; (ii) notation for solutions of the Painlev\'e equations; (iii)…

In this paper an iterated function system on the space of distribution functions is built. The inverse problem is introduced and studied by convex optimization problems. Some applications of this method to approximation of distribution…

It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…

Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…

NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions in mathematics and theoretical computer science as it has…

Bilevel optimization formulates hierarchical decision-making processes that arise in many real-world applications such as in pricing, network design, and infrastructure defense planning. In this paper, we consider a class of bilevel…

The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…

In work the numerical solutions of Kundu-Eckhaus equation are presented. The conditions of dominate nonlinearity or disperse are cleared up.

The Edelman-Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman-Jamison problem is equivalent to the well known…