Results 1 to 10 of about 1,709,062 (125)
Iterated linear optimization [PDF]
Quarterly of Applied Mathematics, 2021 We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular, we consider elliptopes and derive an algebraic characterization of their fixed points.
Pedro F. Felzenszwalb +2 more
openaire +3 more sources
Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization
Mathematical Programming, 2022 Abstract For an integer linear optimization (ILO) problem, persistency of its linear optimization (LO) relaxation is a property that for every optimal solution of the relaxation that assigns integer values to some variables, there exists an optimal solution of the ILO problem in which these variables retain the ...
Kei Kimura, Kotaro Nakayama
openaire +2 more sources
Saturation in Linear Optimization [PDF]
Journal of Optimization Theory and Applications, 2003 In a solvable linear optimization problem, a constraint is saturated if it is binding at a certain optimal solution and it is weakly saturated if it is binding at a proper subset of the optimal set. Nonsaturation and weak saturation can be seen as redundancy phenomena in the sense that the elimination of a finite number of these constraints preserves ...
Goberna, M. A., Jornet, V., Molina, M.
openaire +2 more sources
An Optimal Tester for k-Linear
Theoretical Computer Science, 2022 A Boolean function $f:\{0,1\}^n\to \{0,1\}$ is $k$-linear if it returns the sum (over the binary field $F_2$) of $k$ coordinates of the input. In this paper, we study property testing of the classes $k$-Linear, the class of all $k$-linear functions, and $k$-Linear$^*$, the class $\cup_{j=0}^kj$-Linear. We give a non-adaptive distribution-free two-sided
openaire +4 more sources
On Optimal Interpolation In Linear Regression
CoRR, 2021 25 pages, 7 figures, to appear in NeurIPS ...
Oravkin, E, Rebeschini, P
openaire +4 more sources
Cluster-Based Optimization of Cellular Materials and Structures for Crashworthiness [PDF]
, 2018 The objective of this work is to establish a cluster-based optimization method for the optimal design of cellular materials and structures for crashworthiness, which involves the use of nonlinear, dynamic finite element models. The proposed method uses a
Detwiler, Duane, Liu, Kai, Tovar, Andres
core +1 more source
On conditions for linearity of optimal estimation [PDF]
2010 IEEE Information Theory Workshop, 2010 When is optimal estimation linear? It is well known that, when a Gaussian source is contaminated with Gaussian noise, a linear estimator minimizes the mean square estimation error. This paper analyzes, more generally, the conditions for linearity of optimal estimators. Given a noise (or source) distribution, and a specified signal to noise ratio (SNR),
Emrah Akyol +2 more
openaire +2 more sources
Finding Dominators via Disjoint Set Union [PDF]
, 2013 The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We develop an algorithm
Fraczak, Wojciech +3 more
core +1 more source
Optimality of linearity with collusion and renegotiation [PDF]
Mathematical Social Sciences, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mehmet Barlo, Ayça Özdogan
openaire +10 more sources
Convex Combinatorial Optimization [PDF]
, 2003 We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several
Onn, Shmuel, Rothblum, Uriel G.
core +4 more sources