Results 11  20
of
226
Improved Localization of Cortical Activity by Combining EEG and MEG with MRI Cortical Surface Reconstruction: A Linear Approach
 J. Cogn. Neurosci
, 1993
"... We describe a comprehensive linear approach to the prob lem of imaging brain activity with high temporal as well as spatial resolution based on combining EEG and MEG data with anatomical constraints derived from MRI images. The "inverse problem" of estimating the distribution of dipole st ..."
Abstract

Cited by 263 (19 self)
 Add to MetaCart
strengths over the conical surface is highly nnderdetermined, even given closely spaced EEG and MEG recordings. ',x.'c h:,vc obtained much better solutions to this problem by explicitly incorporating both local cortical orientation as well as spatial covariance of sources and sensors into our
Autocalibration and the absolute quadric
 in Proc. IEEE Conf. Computer Vision, Pattern Recognition
, 1997
"... We describe a new method for camera autocalibration and scaled Euclidean structure and motion, from three or more views taken by a moving camera with fixed but unknown intrinsic parameters. The motion constancy of these is used to rectify an initial projective reconstruction. Euclidean scene structu ..."
Abstract

Cited by 248 (7 self)
 Add to MetaCart
structure is formulated in terms of the absolute quadric — the singular dual 3D quadric ( rank 3 matrix) giving the Euclidean dotproduct between plane normals. This is equivalent to the traditional absolute conic but simpler to use. It encodes both affine and Euclidean structure, and projects very simply
Linear conic optimization for nonlinear optimal control
, 2014
"... Infinitedimensional linear conic formulations are described for nonlinear optimal control problems. The primal linear problem consists of finding occupation measures supported on optimal relaxed controlled trajectories, whereas the dual linear problem consists of finding the largest lower bound on ..."
Abstract
 Add to MetaCart
Infinitedimensional linear conic formulations are described for nonlinear optimal control problems. The primal linear problem consists of finding occupation measures supported on optimal relaxed controlled trajectories, whereas the dual linear problem consists of finding the largest lower bound
Conic Optimization: An Elegant Framework for Convex Optimization
, 2001
"... The purpose of this survey article is to introduce the reader to a very elegant formulation of convex optimization problems called conic optimization and outline its many advantages. After a brief introduction to convex optimization, the notion of convex cone is introduced, which leads to the conic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The purpose of this survey article is to introduce the reader to a very elegant formulation of convex optimization problems called conic optimization and outline its many advantages. After a brief introduction to convex optimization, the notion of convex cone is introduced, which leads to the conic
Extended Formulations in Mixed Integer Conic Quadratic Programming
, 2015
"... In this paper we consider the use of extended formulations in LPbased algorithms for mixed integer conic quadratic programming (MICQP). Through an homogenization procedure we generalize an existing extended formulation to general conic quadratic constraints. We then compare its effectiveness again ..."
Abstract
 Add to MetaCart
In this paper we consider the use of extended formulations in LPbased algorithms for mixed integer conic quadratic programming (MICQP). Through an homogenization procedure we generalize an existing extended formulation to general conic quadratic constraints. We then compare its effectiveness
Space tensor conic programming
, 2009
"... Space tensors appear in physics and mechanics, and they are real physical entities. Mathematically, they are tensors in the threedimensional Euclidean space. In the research of diffusion magnetic resonance imaging, convex optimization problems are formed where higher order positive semidefinite sp ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
definite space tensors are involved. In this short paper, we investigate these problems from the viewpoint of conic linear programming (CLP). We characterize the dual cone of the positive semidefinite space tensor cone, and study the CLP formulation and the duality of the positive semidefinite space tensor
On Duality Theory of Conic Linear Problems
 in SemiInfinite Programming
, 2000
"... In this paper we discuss duality theory of optimization problems with a linear objective function and subject to linear constraints with cone inclusions, referred to as conic linear problems. We formulate the Lagrangian dual of a conic linear problem and survey some results based on the conjugate du ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
In this paper we discuss duality theory of optimization problems with a linear objective function and subject to linear constraints with cone inclusions, referred to as conic linear problems. We formulate the Lagrangian dual of a conic linear problem and survey some results based on the conjugate
Conic Geometric Programming
, 2013
"... We introduce and study conic geometric programs (CGPs), which are convex optimization problems that unify geometric programs (GPs) and conic optimization problems such as semidefinite programs (SDPs). A CGP consists of a linear objective function that is to be minimized subject to affine constraint ..."
Abstract
 Add to MetaCart
We introduce and study conic geometric programs (CGPs), which are convex optimization problems that unify geometric programs (GPs) and conic optimization problems such as semidefinite programs (SDPs). A CGP consists of a linear objective function that is to be minimized subject to affine
Conic Geometric Programming
, 2013
"... We introduce and study conic geometric programs (CGPs), which are convex optimization problems that unify geometric programs (GPs) and conic optimization problems such as linear programs (LPs) and semidefinite programs (SDPs). A CGP consists of a linear objective function that is to be minimized sub ..."
Abstract
 Add to MetaCart
We introduce and study conic geometric programs (CGPs), which are convex optimization problems that unify geometric programs (GPs) and conic optimization problems such as linear programs (LPs) and semidefinite programs (SDPs). A CGP consists of a linear objective function that is to be minimized
GRAVITATIONAL ENERGY OF CONICAL DEFECTS
, 1996
"... The energy density εg of asymptoticaly flat gravitational fields can be calculated from a simple expression involving the trace of the torsion tensor. The integral of this energy density over the whole space yields the ADM energy. Such energy expression can be justified within the framework of the t ..."
Abstract
 Add to MetaCart
of the teleparallel equivalent of general relativity, which is an alternative geometrical formulation of Einstein’s general relativity. In this letter we apply εg to the evaluation of the energy per unit length of a class of conical defects of topological nature, which include disclinations and dislocations (in
Results 11  20
of
226