Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
89,458
Globally optimal solution to multiobject tracking with merged measurements
- In ICCV
, 2011
"... Multiple object tracking has been formulated recently as a global optimization problem, and solved efficiently with optimal methods such as the Hungarian Algorithm. A se-vere limitation is the inability to model multiple objects that are merged into a single measurement, and track them as a group, w ..."
Abstract
-
Cited by 37 (1 self)
- Add to MetaCart
Multiple object tracking has been formulated recently as a global optimization problem, and solved efficiently with optimal methods such as the Hungarian Algorithm. A se-vere limitation is the inability to model multiple objects that are merged into a single measurement, and track them as a group
Robust synthesis in `1: A globally optimal solution
- IEEE Transactions on Automatic Control
, 2001
"... Abstract—In this paper, a method to synthesize controllers that achieve globally optimal robust performance within any prespec-ified tolerance, against structured norm-bounded time-varying and/or nonlinear uncertainty is developed. The performance measure considered is the infinity to infinity induc ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract—In this paper, a method to synthesize controllers that achieve globally optimal robust performance within any prespec-ified tolerance, against structured norm-bounded time-varying and/or nonlinear uncertainty is developed. The performance measure considered is the infinity to infinity
Global Optimal Solutions for Reservoir Engineering Applications
"... In oil reservoir management it is necessary to periodically update the simulation model in order to be able to better predict its future behavior. The problem of history matching consists in determining rock and rock/fluid interaction properties in such a way that observed fluid productions are repr ..."
Abstract
- Add to MetaCart
number of designs using global data fitting such as DACE. The optimization algorithm repetitive analysis needs are all performed using the cheap metamodels. In this study a two-stage approach is employed based on the Efficient Global Optimization algorithm, EGO, due to Jones. First an initial sample
Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- INFORMS J. COMPUT
, 2008
"... This paper is concerned with the single-row facility layout problem (SRFLP). A globally optimal solution to the SRFLP is a linear placement of rectangular facilities with varying lengths that achieves the minimum total cost associated with the (known or projected) interactions between them. We demon ..."
Abstract
-
Cited by 17 (1 self)
- Add to MetaCart
This paper is concerned with the single-row facility layout problem (SRFLP). A globally optimal solution to the SRFLP is a linear placement of rectangular facilities with varying lengths that achieves the minimum total cost associated with the (known or projected) interactions between them. We
Global Optimization with Polynomials and the Problem of Moments
- SIAM JOURNAL ON OPTIMIZATION
, 2001
"... We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear ma ..."
Abstract
-
Cited by 577 (48 self)
- Add to MetaCart
matrix inequality (LMI) problems. A notion of Karush-Kuhn-Tucker polynomials is introduced in a global optimality condition. Some illustrative examples are provided.
Distribution Expansion Problem: Formulation and Practicality for a Multistage Globally Optimal Solution
- in Proc. Power Engineering Society Winter Meeting
"... : Despite numerous research efforts of the past 40 years in the area of distribution expansion, a clear definition of the problem, and a truly multistage formulation that addresses practical concerns is yet to be developed. In this paper, the problem is clearly defined and analyzed from a practical ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
point of view. A directed graph minimum edge cost network flow modeling of the problem for a truly multistage formulation using mathematical programming that guarantees global optimality and addresses the noted deficiencies is proposed. The proposed formulation is implemented on small case studies under
Globally Optimal Solutions for Large Single-Row Facility Layout Problems
, 2006
"... This paper is concerned with the single-row facility layout problem (SRFLP). The SRFLP asks for an optimal linear placement of rectangular facilities with varying lengths on a straight line so as to minimize the total cost associated with the (known or projected) interactions between them. First, we ..."
Abstract
- Add to MetaCart
of the underlying cut polytope are automatically enforced. On the computational side, we use the SDP relaxation to obtain globally optimal layouts for large SRFLPs with up to thirty facilities, some of which have remained unsolved since 1988.
Results 1 - 10
of
89,458
