搜索结果: 1-8 共查到“运筹学 generalized”相关记录8条 . 查询时间(0.053 秒)
A global BMI algorithm based on the generalized Benders decomposition
Linear matrix inequalities Robust control Numerical Methods
2015/8/11
We present a new algorithm for the global solution of optimization problems involving bilinear matrix inequalities (BMIs). The method is based on a technique known in large-scale and global optimizati...
Target Identification Using Dictionary Matching of Generalized Polarization Tensors
generalized polarization tensors target identification shape representation stability analysis
2012/4/16
The aim of this paper is to provide a fast and efficient procedure for (real-time) target identification in imaging based on matching on a dictionary of precomputed generalized polarization tensors (G...
Equivalent Bilevel Programming Form for the Generalized Nash Equilibrium Problem
Generalized Nash equilibrium point Bilevel Programming efficient solution optimal solution
2011/11/17
Generalized Nash Equilibrium problem is widely used but hard to solve. In this paper, we transform the generalized Nash game into a special bilevel programming with one leader and multi-followers by s...
Tchebycheff systems and extremal problems for generalized moments: a brief survey
Tchebycheff systems extremal problems brief survey Optimization and Control
2011/9/14
Abstract: A brief presentation of basics of the theory of Tchebycheff and Markov systems of functions and its applications to extremal problems for integrals of such functions is given. The results, a...
Optimal entanglement witnesses from generalized reduction and Robertson maps
Optimal entanglement witnesses generalized reduction Robertson maps
2011/3/4
We provide a generalization of the reduction and Robertson positive maps in matrix algebras. They give rise to a new class of optimal entanglement witnesses. Their structural physical approximation is...
The generalized connectivity of complete bipartite graphs
k-connectivity complete bipartite graph edge-disjoint spanning trees
2011/2/28
Let G be a nontrivial connected graph of order n, and k an integer with 2 ≤k ≤ n. For a set S of k vertices of G, let κ(S) denote the maximum number ℓ of edge-disjoint trees T1, T2, . . . , T...
Generalized Delaunay Graphs with respect to any Convex Set are Plane Graphs
Generalized Delaunay Graphs Convex Set Plane Graphs
2011/3/3
We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and ...
A diagrammatic category for generalized Bott-Samelson bimodules and a diagrammatic categorification of induced trivial modules for Hecke algebras
diagrammatic category generalized Bott-Samelson bimodules diagrammatic categorification of induced trivial modules for Hecke algebras
2010/12/3
We consider the problem of enumerating permutations in the symmetric group on n elements
which avoid a given set of consecutive pattern S, and in particular computing asymptotics as n
tends to infin...