Related papers: The Multidimensional Moment Problem with Complexit…
Larrauri and \v{Z}ivn\'y [ICALP'25/ACM ToCL'24] recently established a complete complexity classification of the problem of solving a system of equations over a monoid $N$ assuming that a solution exists over a monoid $M$, where both…
The paper focuses on a multidimensional optimization problem, which is formulated in terms of tropical mathematics and consists in minimizing a nonlinear objective function subject to linear inequality constraints. To solve the problem, we…
We consider a Kepler problem in dimension two or three, with a time-dependent $T$-periodic perturbation. We prove that for any prescribed positive integer $N$, there exist at least $N$ periodic solutions (with period $T$) as long as the…
In this paper, we study the iteration complexity of cubic regularization of Newton method for solving composite minimization problems with uniformly convex objective. We introduce the notion of second-order condition number of a certain…
A variety of approaches has been developed to deal with uncertain optimization problems. Often, they start with a given set of uncertainties and then try to minimize the influence of these uncertainties. Depending on the approach used, the…
We consider the "moment vanishing problem" for a general class of piecewise-analytic functions which satisfy on each continuity interval a linear ODE with polynomial coefficients. This problem, which essentially asks how many zero first…
Analytical methods are used to prove the existence of a periodic, symmetric solution with singularities in the planar 4-body problem. A numerical calculation and simulation are used to generate the orbit. The analytical method easily…
In this paper, we address the problem of bounding conditional expectations when moment information of the underlying distribution and the random event conditioned upon are given. To this end, we propose an adapted version of the generalized…
We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…
In this work we consider optimal stopping problems with conditional convex risk measures called optimised certainty equivalents. Without assuming any kind of time-consistency for the underlying family of risk measures, we derive a novel…
The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…
Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as an efficient back-end for solving NP-complete problems. However, many fundamental problems in knowledge representation and reasoning are located at…
Given a multi-index sequence $\mu_{\mathbf{k}}$, $\mathbf{k} = (k_1,..., k_n) \in \mathbb{N}_0^n$, necessary and sufficient conditions are given for the existence of a regular Borel polymeasure $\gamma$ on the unit interval $I= [0,1]$ such…
One of the two existing strategies of resolving singularities of multifold Mellin-Barnes integrals in the dimensional regularization parameter, or a parameter of the analytic regularization, is formulated in a modified form. The…
We provide three new proofs of the strong concavity of the dual function of some convex optimization problems. For problems with nonlinear constraints, we show that the the assumption of strong convexity of the objective cannot be weakened…
The paper suggests a new --- to the best of the author's knowledge --- characterization of decisions which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a…
In this paper we studied combinatorial problems with parameterized locally budgeted uncertainty. We are looking for a solutions set such that for any parameters vector there exists a solution in the set with robustness near optimal. The…
We introduce a new strategy in solving the truncated complex moment problem. To this aim we investigate recursive doubly indexed sequences and their characteristic polynomials. A characterization of recursive doubly indexed \emph{moment}…
Maximizing monotone submodular functions under cardinality constraints is a classic optimization task with several applications in data mining and machine learning. In this paper we study this problem in a dynamic environment with…
The constraint equations of general relativity can in many cases be solved by the conformal method. We show that a slight modification of the equations of the conformal method admits no solution for a broad range of parameters. This…