English
Related papers

Related papers: Self-concordance is NP-hard

200 papers

It is established that general s-convex functions are a new class of generalized convex functions. In a similar vein, a new class of general s-convex sets is introduced, which are generalizations of s-convex sets. Additionally, certain…

Optimization and Control · Mathematics 2023-01-03 Musavvir Ali , Ehtesham Akhter

A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…

Optimization and Control · Mathematics 2016-05-30 James Renegar

We consider the problem of determining, given x, y in Z^k and a finite set F of affine functions on Z^k, whether y is reachable from x by applying the functions F. We also consider the analogous problem over N^k. These problems are known to…

Formal Languages and Automata Theory · Computer Science 2013-04-10 Daniel Fremont

In the setup of i.i.d.~observations and a real valued differentiable functional~$T$, locally asymptotic upper bounds are derived for the power of one-sided tests (simple, versus large values of~$T$)and for the confidence probability of…

Statistics Theory · Mathematics 2014-12-05 Helmut Rieder

The goal of this note is to construct, on many manifolds, non-trivial concordances from the identity to itself. This produces counterexamples to a recent conjecture by Botvinnik.

Geometric Topology · Mathematics 2012-12-13 Wolfgang Steimle

It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…

Differential Geometry · Mathematics 2024-04-29 Jilly Kevo

In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…

Optimization and Control · Mathematics 2019-08-22 James V. Burke , Tim Hoheisel , Quang V. Nguyen

Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…

Statistics Theory · Mathematics 2024-03-07 Mikhail Ermakov

We prove a Hardy inequality on convex sets, for fractional Sobolev-Slobodecki\u{\i} spaces of order $(s,p)$. The proof is based on the fact that in a convex set the distance from the boundary is a superharmonic function, in a suitable…

Analysis of PDEs · Mathematics 2018-06-12 Lorenzo Brasco , Eleonora Cinti

We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…

Computational Geometry · Computer Science 2023-04-27 Thijs van der Horst , Tim Ophelders , Bart van der Steenhoven

We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…

Computational Complexity · Computer Science 2016-04-20 Andreas Darmann , Janosch Döcker , Britta Dorn

The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to…

Logic in Computer Science · Computer Science 2016-07-07 Prateek Karandikar , Philippe Schnoebelen

This paper defines a convertible nonconvex function(CN function for short) and a weak (strong) uniform (decomposable, exact) CN function, proves the optimization conditions for their global solutions and proposes algorithms for solving the…

Optimization and Control · Mathematics 2022-02-16 M. Jiang , R. Shen , Z. Q. Meng , C. Y. Dang

In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additional indicator. This set occurs pervasively in optimization…

Optimization and Control · Mathematics 2022-09-07 Andres Gomez , Weijun Xie

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Jörg Endrullis , Jeffrey Shallit , Tim Smith

This paper considers projection and convolution operations for integrally convex functions, which constitute a fundamental function class in discrete convex analysis. It is shown that the class of integrally convex functions is stable under…

Optimization and Control · Mathematics 2018-08-09 Satoko Moriguchi , Kazuo Murota

We prove a Burns-Krantz type boundary rigidity near strongly pseudoconvex points for holomorphic self-maps with an interior fixed point. This confirms a conjecture of Huang.

Complex Variables · Mathematics 2023-02-15 Feng Rong

In this work we establish a connection between two classical notions, unrelated so far: Harmonic functions on the one hand and absolutely monotonic functions on the other hand. We use this to prove convexity type and propagation of…

Analysis of PDEs · Mathematics 2015-12-09 Gabor Lippner , Dan Mangoubi

We present in this paper a result about existence and convexity of solutions to a free boundary problem of Bernoulli type, with non constant gradient boundary constraint depending on the outer unit normal. In particular we prove that, in…

Analysis of PDEs · Mathematics 2010-09-08 Chiara Bianchini

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

Dynamical Systems · Mathematics 2018-11-19 Fabien Durand , Valérie Goyheneche