Results 1  10
of
8,741
ERROR BOUNDS FOR DEGENERATE CONE INCLUSION PROBLEMS
"... Abstract. Error bounds for cone inclusion problems in Banach spaces are established under conditions weaker than Robinson’s constraint qualification. The results allow the cone to be more general than the origin, therefore also generalize a classical error bound result concerning equalityconstrained ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Error bounds for cone inclusion problems in Banach spaces are established under conditions weaker than Robinson’s constraint qualification. The results allow the cone to be more general than the origin, therefore also generalize a classical error bound result concerning
Proceedings of ACMD06 A00598 SOLVING NORMAL CONE INCLUSION PROBLEMS IN CONTACT MECHANICS BY ITERATIVE METHODS
"... In this paper we show how inclusions originating from setvalued force laws can be written as nonlinear equations for finitedimensional second order dynamical systems. We express the setvalued force laws as subdifferentials of the indicator function to a given convex set C, apply the augmented La ..."
Abstract
 Add to MetaCart
In this paper we show how inclusions originating from setvalued force laws can be written as nonlinear equations for finitedimensional second order dynamical systems. We express the setvalued force laws as subdifferentials of the indicator function to a given convex set C, apply the augmented
Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
, 1998
"... SeDuMi is an addon for MATLAB, that lets you solve optimization problems with linear, quadratic and semidefiniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved efficiently, by exploiting sparsity. This pape ..."
Abstract

Cited by 1368 (5 self)
 Add to MetaCart
SeDuMi is an addon for MATLAB, that lets you solve optimization problems with linear, quadratic and semidefiniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved efficiently, by exploiting sparsity
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 547 (12 self)
 Add to MetaCart
We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized
Lightness and Retinex Theory
 JOURNAL OF THE OPTICAL SOCIETY OF AMERICA
, 1971
"... Sensations of color show a strong correlation with reflectance, even though the amount of visible light reaching the eye depends on the product of reflectance and illumination. The visual system must achieve this remarkable result by a scheme that does not measure flux. Such a scheme is described as ..."
Abstract

Cited by 497 (6 self)
 Add to MetaCart
as the basis of retinex theory. This theory assumes that there are three independent cone systems, each starting with a set of receptors peaking, respectively, in the long, middle, and shortwavelength regions of the visible spectrum. Each system forms a separate image of the world in terms of lightness
Pushing the EL envelope
 In Proc. of IJCAI 2005
, 2005
"... Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already int ..."
Abstract

Cited by 461 (59 self)
 Add to MetaCart
Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already
BRITE: An approach to universal topology generation,”
 in Proceedings of the IEEE Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems,
, 2001
"... Abstract Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the largescale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. U ..."
Abstract

Cited by 448 (12 self)
 Add to MetaCart
. Unfortunately, developing a deep understanding of these issues has proven to be a challenging task, since it in turn involves solving difficult problems such as mapping the actual topology, characterizing it, and developing models that capture its emergent behavior. Consequently, even though there are a number
Multiple kernel learning, conic duality, and the SMO algorithm
 In Proceedings of the 21st International Conference on Machine Learning (ICML
, 2004
"... While classical kernelbased classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. (2004) considered conic combinations of kernel matrices for the support vector machine (SVM), and showed that the optimiz ..."
Abstract

Cited by 445 (31 self)
 Add to MetaCart
; moreover, the sequential minimal optimization (SMO) techniques that are essential in largescale implementations of the SVM cannot be applied because the cost function is nondifferentiable. We propose a novel dual formulation of the QCQP as a secondorder cone programming problem, and show how to exploit
SecondOrder Cone Programming
 MATHEMATICAL PROGRAMMING
, 2001
"... In this paper we survey the second order cone programming problem (SOCP). First we present several applications of the problem in various areas of engineering and robust optimization problems. We also give examples of optimization problems that can be cast as SOCPs. Next we review an algebraic struc ..."
Abstract

Cited by 247 (11 self)
 Add to MetaCart
In this paper we survey the second order cone programming problem (SOCP). First we present several applications of the problem in various areas of engineering and robust optimization problems. We also give examples of optimization problems that can be cast as SOCPs. Next we review an algebraic
Recognition of visual activities and interactions by stochastic parsing
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2000
"... This paper describes a probabilistic syntactic approach to the detection and recognition of temporally extended activities and interactions between multiple agents. The fundamental idea is to divide the recognition problem into two levels. The lower level detections are performed using standard inde ..."
Abstract

Cited by 322 (8 self)
 Add to MetaCart
This paper describes a probabilistic syntactic approach to the detection and recognition of temporally extended activities and interactions between multiple agents. The fundamental idea is to divide the recognition problem into two levels. The lower level detections are performed using standard
Results 1  10
of
8,741