English
Related papers

Related papers: Four Vignettes on Apparent Size

200 papers

Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…

Information Theory · Computer Science 2011-07-22 Arun Padakandla , Rajesh Sundaresan

We study uncertainty relations for pairs of conjugate variables like number and angle, of which one takes integer values and the other takes values on the unit circle. The translation symmetry of the problem in either variable implies that…

Quantum Physics · Physics 2018-04-03 Paul Busch , Jukka Kiukas , Reinhard F. Werner

We consider geometrical optimization problems related to optimizing the error probability in the presence of a Gaussian noise. One famous questions in the field is the "weak simplex conjecture". We discuss possible approaches to it, and…

Metric Geometry · Mathematics 2017-01-30 Alexey Balitskiy , Roman Karasev , Alexander Tsigler

Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…

Optimization and Control · Mathematics 2019-01-25 Heinz H. Bauschke , Sylvain Gretchko , Walaa M. Moursi

In information theory, some optimization problems result in convex optimization problems on strictly convex functionals of probability densities. In this note, we study these problems and show conditions of minimizers and the uniqueness of…

Information Theory · Computer Science 2020-03-17 Tomohiro Nishiyama

We address the observability problem for ensembles that are described by probability distributions. The problem is to reconstruct a probability distribution of the initial state from the time-evolution of the probability distribution of the…

Optimization and Control · Mathematics 2015-07-09 Shen Zeng , Steffen Waldherr , Christian Ebenbauer , Frank Allgower

We introduce an algorithm which can be directly used to feasible and optimum search in linear programming. Starting from an initial point the algorithm iteratively moves a point in a direction to resolve the violated constraints. At the…

Optimization and Control · Mathematics 2023-12-05 Denys Shcherbak , Natalya Pya Arnqvist

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…

Optimization and Control · Mathematics 2023-03-30 Shuting Ai , Jinlu Li

4-dimensional optics is here introduced axiomatically as the space that supports a Universal wave equation which is applied to the postulated Higgs field. Self-guiding of this field is shown to produce all the modes necessary to provide…

High Energy Physics - Theory · Physics 2007-05-23 Jose B. Almeida

The problem of searching for a model-based scene interpretation is analyzed within a probabilistic framework. Object models are formulated as generative models for range data of the scene. A new statistical criterion, the truncated object…

Computer Vision and Pattern Recognition · Computer Science 2007-05-23 Ulrich Hillenbrand , Gerd Hirzinger

With the present and soon-to-be breakthrough of optical interferometry, countless objects shall be within reach of interferometers; yet, most of them are expected to remain only marginally resolved with hectometric baselines. In this paper,…

Astrophysics · Physics 2009-11-07 Regis Lachaume

We investigate the techniques and ideas used in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM…

Optimization and Control · Mathematics 2019-12-20 Sebastian Banert , Radu Ioan Bot , Ernö Robert Csetnek

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…

Optimization and Control · Mathematics 2024-01-26 Andreas Löhne

This note being devoted to some aspects of the inverse problem of representation theory contains a new insight into it illustrated by two topics. The attention is concentrated on the manner of representation of abstract objects by the…

funct-an · Mathematics 2008-02-03 Denis V. Juriev

This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…

Optimization and Control · Mathematics 2022-04-20 Xiaoxi Jia , Christian Kanzow , Patrick Mehlitz , Gerd Wachsmuth

One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

We give new results for problems in computational and statistical machine learning using tools from high-dimensional geometry and probability. We break up our treatment into two parts. In Part I, we focus on computational considerations in…

Optimization and Control · Mathematics 2025-04-24 Naren Sarayu Manoj

Recently the authors have explored new concepts of plurisubharmonicity and pseudoconvexity, with much of the attendant analysis, in the context of calibrated manifolds. Here a much broader extension is made. This development covers a wide…

Differential Geometry · Mathematics 2017-12-12 F. Reese Harvey , H. Blaine Lawson

Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…

General Mathematics · Mathematics 2021-05-14 Yang Ji

We consider the stochastic geometry model where the location of each node is a random point in a given metric space, or the existence of each node is uncertain. We study the problems of computing the expected lengths of several…

Data Structures and Algorithms · Computer Science 2015-02-18 Lingxiao Huang , Jian Li