The paracatadioptric camera is one of the most popular panoramic systems currently available in the market. It provides a wide field of view by combining a parabolic shaped mirror with a camera inducing an orthographic projection. Previous work proved that the paracatadioptric projection of a line is a conic curve, and that the sensor can be fully calibrated from the image of three or more line...

In this paper, the concepts of symmetric q-calculus and conic regions are used to define a new domain Ωk,q,α˜, which generalizes domains. By using we subclass analytic q-starlike functions in open unit disk U establish some results for class. We also investigate number useful properties characteristics subclass, such as coefficients estimates, structural formulas, distortion inequalities, neces...

This paper studies several classes of nonconvex optimization problems defined over convex cones, establishing connections between them and demonstrating that they can be equivalently formulated as convex completely positive programs. The problems being studied include: a conic quadratically constrained quadratic program (QCQP), a conic quadratic program with complementarity constraints (QPCC), ...

Konstantinos Daniilidis and J org Ernst Computer Science Institute, Kiel University Abstract During a camera motion with arbitrary translation and xed axis rotation a vanishing point traverses a conic section on the image plane. The intrinsic parameters of the camera can be obtained from the coe cients of the conic. Special care is given to the propagation of the error covariances and the elim...

We construct a relative Chow-Künneth decomposition for a conic bundle over a surface such that the middle projector gives the Prym variety of the associated double covering of the discriminant of the conic bundle. This gives a refinement (up to an isogeny) of Beauville’s theorem on the relation between the intermediate Jacobian of the conic bundle and the Prym variety of the double covering.

We establish polynomial-time convergence of infeasible-interior-point methods for conic programs over symmetric cones using a wide neighborhood of the central path. The convergence is shown for a commutative family of search directions used in Schmieta and Alizadeh [9]. These conic programs include linear and semidefinite programs. This extends the work of Rangarajan and Todd [8], which establi...

Abstract This paper describes the conic operator splitting method (COSMO) solver, an algorithm and associated software package for convex optimisation problems with quadratic objective function constraints. At each step, alternates between solving a quasi-definite linear system constant coefficient matrix projection onto sets. The low per-iteration computational cost makes particularly efficien...

Square-root elds are diierentiable operator elds used in the construction of target direction elds for self-scaled conic programming, a unifying framework for primal-dual interior-point methods for linear programming, semideenite programming and second-order cone programming. In this article we investigate square-root elds for so-called isotropic self-scaled barrier functionals, i.e. self-scale...

In 1999, for (0≤k<∞), the concept of conic domain by defining k-uniform convex functions were introduced Kanas and Wisniowska then in 2000, they defined related k-starlike denoted k−UCV k−ST respectively. Motivated their studies, our work, we define class k-parabolic starlike functions, k−SHm,q, using quasi-subordination m-fold symmetric analytic making use Ωk. We determine coefficient bound...

Mixed-integer conic programming is a generalization of mixed-integer linear programming. In this paper, we present an extension of the duality theory for mixed-integer linear programming (see [4], [11]) to the case of mixed-integer conic programming. In particular, we construct a subadditive dual for mixed-integer conic programming problems. Under a simple condition on the primal problem, we ar...