English
Related papers

Related papers: Super Solutions of the Model RB

200 papers

A long series of previous papers have been devoted to the (one-dimensional) moment problem with nonnegative rational measure. The rationality assumption is a complexity constraint motivated by applications where a parameterization of the…

Optimization and Control · Mathematics 2016-04-07 Johan Karlsson , Anders Lindquist , Axel Ringh

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

Probability · Mathematics 2007-05-23 Dimitris Achlioptas , Assaf Naor , Yuval Peres

We present an standard constraints generation algorithm to find an explicit set whose robustness is equal to the robustness of the feasible solution set of a combinatorial optimization problem with cost uncertainty. Computational experience…

Optimization and Control · Mathematics 2023-04-11 Alejandro Crema

The Robust Satisficing (RS) model is an emerging approach to robust optimization, offering streamlined procedures and robust generalization across various applications. However, the statistical theory of RS remains unexplored in the…

Machine Learning · Statistics 2024-06-03 Zhiyi Li , Yunbei Xu , Ruohan Zhan

This paper extends the model reduction method by the operator projection to the one-dimensional special relativistic Boltzmann equation. The derivation of arbitrary order globally hyperbolic moment system is built on our careful study of…

Analysis of PDEs · Mathematics 2017-04-26 Yangyu Kuang , Huazhong Tang

We prove the existence of global solutions to the energy-supercritical wave equation in R^{3+1} u_{tt}-\Delta u + |u|^N u = 0, u(0) = u_0, u_t(0) = u_1, 4<N<\infty, for a large class of radially symmetric finite-energy initial data.…

Analysis of PDEs · Mathematics 2017-02-17 Marius Beceanu , Avy Soffer

We consider the focusing $5$d Hartree equation, which is $L^2$-supercritical, with finite energy initial data, and investigate the solutions at the mass-energy threshold. We establish the existence of special solutions following the work of…

Analysis of PDEs · Mathematics 2022-10-17 Anudeep K. Arora , Svetlana Roudenko

A continuous approximation for the results of [1] is obtained. In this approximation the energy distribution is represented in the form of the product of the Gibbs factor and superstatistics factor. The mutual weights of the factors are…

Chemical Physics · Physics 2007-05-23 V. V. Ryazanov

In this paper, we investigate super robust estimation approaches, which generate a reliable estimation even when the noise observations are more than half in an experiment. The following preliminary research results on super robustness are…

Methodology · Statistics 2015-02-17 Qinghuai Gao

We consider discrete optimization problems with interval uncertatinty of objective function coefficients. The interval uncertainty models measurements errors. A pos\-sible optimal solution is a solution that is optimal for some possible…

Optimization and Control · Mathematics 2022-06-22 Alexander Prolubnikov

We study the solutions of Von Neumann's expanding model with reversible processes for an infinite reaction network. We show that, contrary to the irreversible case, the solution space need not be convex in contracting phases (i.e. phases…

Disordered Systems and Neural Networks · Physics 2015-05-19 A. De Martino , M. Figliuzzi , M. Marsili

We include alignment interactions in a well-studied first-order attractive-repulsive macroscopic model for aggregation. The distinctive feature of the extended model is that the equation that specifies the velocity in terms of the…

Analysis of PDEs · Mathematics 2016-06-22 Razvan C. Fetecau , Weiran Sun , Changhui Tan

We derive general bounds for the large time size of supnorm values of solutions to one-dimensional advection-diffusion equations with initial data in Lp0 (R) \cap L1 for some 1 <= p0 < \infty, and arbitrary bounded advection speeds b(x, t),…

Analysis of PDEs · Mathematics 2025-01-17 Jose A. Barrionuevo , Lucas S. Oliveira , Paulo. R. Zíngano

Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…

Discrete Mathematics · Computer Science 2009-11-13 Amin Coja-Oghlan

We consider the problem of robust polynomial regression, where one receives samples $(x_i, y_i)$ that are usually within $\sigma$ of a polynomial $y = p(x)$, but have a $\rho$ chance of being arbitrary adversarial outliers. Previously, it…

Data Structures and Algorithms · Computer Science 2017-08-11 Daniel Kane , Sushrut Karmalkar , Eric Price

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

Artificial Intelligence · Computer Science 2009-11-30 Matthias Horbach , Christoph Weidenbach

We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combinations. We prove NP-hardness of the deterministic version,…

Discrete Mathematics · Computer Science 2019-07-23 Maciej Drwal

Maximal regularity is a fundamental concept in the theory of partial differential equations. In this paper, we establish a fully discrete version of maximal regularity for a parabolic equation. We derive various stability results in…

Numerical Analysis · Mathematics 2016-02-23 Tomoya Kemmochi , Norikazu Saito

The existence and uniqueness of the local strong solution to the three-dimensional compressible viscoelastic fluids near the equilibrium is established. In addition to the uniform estimates on the velocity, some essential uniform estimates…

Analysis of PDEs · Mathematics 2010-01-21 Xianpeng Hu , Dehua Wang

In the last two decades the study of random instances of constraint satisfaction problems (CSPs) has flourished across several disciplines, including computer science, mathematics and physics. The diversity of the developed methods, on the…

Combinatorics · Mathematics 2025-07-02 Konstantinos Panagiotou , Matija Pasch