Results 271 to 280 of about 5,277,522 (305)
Some of the next articles are maybe not open access.

Linear Optimization Queries

Journal of Algorithms, 1993
Summary: Let \(\Gamma_ 0\) be a set of \(n\) halfspaces in \(E^ d\) (where the dimension \(d\) is fixed) and let \(m\) be a parameter, \(n\leq m\leq n^{\lfloor d/2\rfloor}\). We show that \(\Gamma_ 0\) can be preprocessed in time and space \(0(m^{1+\delta}\)) (for any fixed \(\delta>0\)) so that given a vector \(c\in E^ d\) and another set \(\Gamma_ q\)
openaire   +1 more source

Piecewise linear optimization

Computing, 1980
Two methods for solving an optimization problem with piecewise linear, convex, and continuous objective function and linear restrictions are described. The first one represents a generalization of the ordinary Simplex-Algorithm by Dantzig, the second one an adaptation of the Reduced Gradient Method by P. Wolfe to the discussed problem.
openaire   +2 more sources

Optimal Linearization in Holography

Applied Optics, 1969
Optimal linearization in holography is studied from the nonlinear system theory point of view. A generalized optimal linearization method for a physical photographic emulsion is presented. A generalized first-order amplitude transmittance (i.e., the generalized transfer function) with respect to the input irradiance is determined.
openaire   +2 more sources

Abstract Optimal Linear Filtering

SIAM Journal on Control and Optimization, 2000
The linear optimal filtering problems in infinite-dimensional Hilbert spaces and their extensions are investigated. The quality functional is allowed to be a general quadratic functional defined by a possibly degenerate operator. The solutions of the stable and the causal filtering problems are obtained.
Vladimir N. Fomin, Michael V. Ruzhansky
openaire   +2 more sources

LINEAR SCHEDULING IS NEARLY OPTIMAL

Parallel Processing Letters, 1991
This paper deals with the problem of finding optimal schedulings for uniform dependence algorithms. Given a convex domain, let Tf be the total time needed to execute all computations using the free (greedy) schedule and let Tl be the total time needed to execute all computations using the optimal linear schedule.
Darte, Alain   +2 more
openaire   +3 more sources

10 optimizations on linear search

Communications of the ACM, 2016
The operations side of the story.
openaire   +1 more source

Linear and Integer Linear Optimization

1999
This is a textbook about linear and integer linear optimization. The major goal is to develop the theory of linear and integer linear optimization in a unified manner and then demonstrate how to use this theory to solve very large real world problems.
openaire   +1 more source

Linear Optimization

1994
Abstract Optimization is itself a large area within the field of applied mathematics. It deals with the minimization and maximization of functions with or without constraints and has many different applications. A large number of these applications belong to the area of operations research within the economic sciences.
openaire   +1 more source

Preface: Linear optimization

Discrete Applied Mathematics, 2018
Antoine Deza, Frédéric Meunier
openaire   +1 more source

An Interval Sequential Linear Programming for Nonlinear Robust Optimization Problems

Applied Mathematical Modelling, 2022
Jiachang Tang, Chengji Mi, Haibo Liu
exaly  

Home - About - Disclaimer - Privacy