Results 1  10
of
875,771
Error bounds:
"... Optimal control: provides general computational approach to tackle control problemsboth under and fully actuated. Optimal control formalism [Tedrake, Ch. 6, Sutton and Barto Ch.14] ..."
Abstract
 Add to MetaCart
Optimal control: provides general computational approach to tackle control problemsboth under and fully actuated. Optimal control formalism [Tedrake, Ch. 6, Sutton and Barto Ch.14]
SUFFICIENT CONDITIONS FOR ERROR BOUNDS
, 2001
"... For a lower semicontinuous (l.s.c.) inequality system on a Banach space, it is shown that error bounds hold, provided every element in an abstract subdifferential of the constraint function at each point outside the solution set is norm bounded away from zero. A sufficient condition for a global e ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
For a lower semicontinuous (l.s.c.) inequality system on a Banach space, it is shown that error bounds hold, provided every element in an abstract subdifferential of the constraint function at each point outside the solution set is norm bounded away from zero. A sufficient condition for a global
On the Complexity of Computing Error Bounds
 Found. Comput. Math
, 2000
"... We consider the cost of estimating an error bound for the computed solution of a system of linear equations, i.e. estimating the norm of a matrix inverse. Under some technical assumptions we show that computing even a coarse error bound for the solution of a triangular system of equations costs at l ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We consider the cost of estimating an error bound for the computed solution of a system of linear equations, i.e. estimating the norm of a matrix inverse. Under some technical assumptions we show that computing even a coarse error bound for the solution of a triangular system of equations costs
Regularities and Their Relations to Error Bounds
"... In this paper, we mainly study various notions of regularity for a finite collection {C1, · · · , Cm} of closed convex subsets of a Banach space X and their relations with other fundamental concepts. We show that a proper lower semicontinuous function f on X has a Lipschitz error bound (resp., Υ ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In this paper, we mainly study various notions of regularity for a finite collection {C1, · · · , Cm} of closed convex subsets of a Banach space X and their relations with other fundamental concepts. We show that a proper lower semicontinuous function f on X has a Lipschitz error bound (resp
A generalized discrepancy and quadrature error bound
 Math. Comp
, 1998
"... Abstract. An error bound for multidimensional quadrature is derived that includes the KoksmaHlawka inequality as a special case. This error bound takes the form of a product of two terms. One term, which depends only on the integrand, is defined as a generalized variation. The other term, which dep ..."
Abstract

Cited by 141 (13 self)
 Add to MetaCart
Abstract. An error bound for multidimensional quadrature is derived that includes the KoksmaHlawka inequality as a special case. This error bound takes the form of a product of two terms. One term, which depends only on the integrand, is defined as a generalized variation. The other term, which
Error Bounds For Quadratic Systems
 High Performance Optimization
, 1998
"... In this paper we consider the problem of estimating the distance from a given point to the solution set of a quadratic inequality system. We show, among other things, that a local error bound of order 1=2 holds for a system defined by linear inequalities and a single (nonconvex) quadratic equality. ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
In this paper we consider the problem of estimating the distance from a given point to the solution set of a quadratic inequality system. We show, among other things, that a local error bound of order 1=2 holds for a system defined by linear inequalities and a single (nonconvex) quadratic equality
On Error Bounds and Turbo Codes
 IEEE Communications Letters
, 1999
"... : Turbo codes have been hailed as the ultimate step towards achieving the capacity limit Shannon established some 50 years ago. In this letter welookat the performance of Turbo codes with respect to various information theoretic error bounds. This comparison suggests that, if #block, or# frame error ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
: Turbo codes have been hailed as the ultimate step towards achieving the capacity limit Shannon established some 50 years ago. In this letter welookat the performance of Turbo codes with respect to various information theoretic error bounds. This comparison suggests that, if #block, or# frame
Error bounds: Necessary and sufficient conditions
, 2010
"... The paper presents a general classification scheme of necessary and sufficient criteria for the error bound property incorporating the existing conditions. Several derivativelike objects both from the primal as well as from the dual space ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
The paper presents a general classification scheme of necessary and sufficient criteria for the error bound property incorporating the existing conditions. Several derivativelike objects both from the primal as well as from the dual space
Error Bounds for Correlation Clustering
, 2005
"... This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering recovers the correct partition in a planted partition model (Condon & Karp, 2001; McSherry, 2001). Using these bounds ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering recovers the correct partition in a planted partition model (Condon & Karp, 2001; McSherry, 2001). Using
Error Bounds for Convex Inequality Systems
 Generalized Convexity
, 1996
"... Using convex analysis, this paper gives a systematic and unified treatment for the existence of a global error bound for a convex inequality system. We establish a necessary and sufficient condition for a closed convex set defined by a closed proper convex function to possess a global error bound in ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
Using convex analysis, this paper gives a systematic and unified treatment for the existence of a global error bound for a convex inequality system. We establish a necessary and sufficient condition for a closed convex set defined by a closed proper convex function to possess a global error bound
Results 1  10
of
875,771