搜索结果: 1-13 共查到“代数学 Convex”相关记录13条 . 查询时间(0.031 秒)
Closed-loop convex analysis of performance limits for linear control systems
Linear control system computer aided control system and design a linear controller convex optimization digital signal processor
2015/8/12
In closed-loop convex analysis and design, the linear controller design problem is reformulated as a convex optimization problem, which may be more easily solved than the problems resulting from conve...
Robust solutions to l1, l2, and l_infinity uncertain linear approximation problems using convex optimization
Linear random and uncertain data convex optimization
2015/8/11
We present minimax and stochastic formulations of some linear approximation problems with uncertain data in R^n equipped with the Euclidean (l2), Absolute-sum (l1) or Chebyshev (l-infinity) norms. We ...
Highly Robust Error Correction by Convex Programming
Linear codes decoding of (random) linear codes sparse solutions to underdetermined systems `1 minimization linear programming second-order cone programming the Dantzig selector restricted orthonormality Gaussian random matrices and random projections
2015/6/17
This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal x ∈ Rn (a block of n pieces of information) to a remote receiver. We ask whether it is possible...
Exact Boundary Conditions for the Initial Value Problem of Convex Conservation Laws
exact boundary conditions artificial boundary conditions convex conservation laws Burgers’ (inviscid) equation
2015/5/4
The initial value problem of convex conservation laws, which includes the famous Burgers’ (inviscid) equation, plays an important rule not only in the-oretical analysis for conservation laws, but also...
Iteration theory of Maslov-type index associated with a Lagrangian subspace for symplectic paths and Multiplicity of brake orbits in bounded convex symmetric domains
Iteration theory Maslov-type index Lagrangian subspace symplectic paths and Multiplicity brake orbits in bounded convex symmetric domains
2015/4/3
Iteration theory of Maslov-type index associated with a Lagrangian subspace for symplectic paths and Multiplicity of brake orbits in bounded convex symmetric domains.
Recurrence Relations for Strongly q-Log-Convex Polynomials
log-concave q-log-convexity strong q-log-convexity Bell polynomials Bessel polynomials Ramanujan polynomials Dowling polynomials
2014/6/3
We consider a class of strongly q-log-convex polynomials based on a triangular recurrence relation with linear coefficients, and we show that the Bell polynomials, the Bessel polynomials, the Ramanuja...
The Convex Geometry of Linear Inverse Problems
Convex optimization semidefinite programming atomic norms
2011/1/17
In applications throughout science and engineering one is often faced with the challenge of
solving an ill-posed inverse problem, where the number of available measurements is smaller
than the dimen...
A maximin characterization of the escape rate of nonexpansive mappings in metrically convex spaces
maximin characterization escape rate of nonexpansive mappings
2011/2/24
We establish a maximin characterization of the linear escape rate of the orbits
of a nonexpansive mapping on a complete (hemi-)metric space, under a mild form
of Busemann’s nonpositive curvature con...
Generalizing results by Valette, Zamfirescu and Laczkovich, we will here prove that the tiling of any convex body K into convex subsets contains some information on K itself, namely if many tiles are ...
The Hadamard Type Inequalities for M-Convex Functions
The Hadamard Type Inequalities M-Convex Functions
2010/11/11
In this paper we obtained some new Hadamard-Type inequalities for functions whose derivatives absolute values m-convex. Some applications to special means of real numbers are given.
We prove that a C1,1-smooth bounded domain D in Cn is linearly convex if and only if the convex hull of any two discs in D with common center lies in D.
The most inaccessible point of a convex domain
Convex domain polygons triangle notable points
2010/12/7
The inaccessibility of a point p in a bounded domain D Rn is the minimum of the lengths of segments through p with boundary at @D. The points of maximum inaccessibility ID are those where the inacce...
On Locally pre-C*-Algebra Structures in Locally m-Convex H*-Algebras
Locally pre- C*-algebra locally m-convex H*-algebra Q-algebra positive semi-definite inner product
2010/3/1
We endow any locally m-convex H*-algebra \left( E,t \right) with a locally pre-C*-topology weaker than t. Examples and applications are provided.