We describe simple and exact duals, and certificates of infeasibility and weak infeasibility in conic linear programming which do not rely on any constraint qualification, and retain most of the simplicity of the Lagrange dual. In particular, some of our infeasibility certificates generalize the row echelon form of a linear system of equations, and the “easy” proofs – as sufficiency of a certif...

We show that the complexity (the number of elements) of an optimal parabolic or conic spline approximating a smooth curve with non-vanishing curvature to within symmetric difference distance ε is c1 ε −1/4 + O(1), if the spline consists of parabolic arcs and c2 ε −1/5 +O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the affine curvature of...

In this paper, under a suitable regularity condition, we establish that a broad class of conic convex polynomial optimization problems, called conic sum-of-squares convex polynomial programs, exhibits exact conic programming relaxation, which can be solved by various numerical methods such as interior point methods. By considering a general convex cone-program, we give unified results that appl...

This paper presents a series of approaches for discrete time-domain synthesis of conical bore instrument sounds. The generation of steady, selfsustained oscillations using conical waveguides is complicated by properties inherent to truncated conic frusta. Two different physical structures are discussed which can be characterized by the same circuit diagram. A more abstract and flexible “virtual...

Hough Transform (HT) is a method for shape extraction that uses a parameter accumulator array. Based on the analysis of generic conic equation it is possible to establish a robust approach for conic shape identification in images if some aspects are respected. This paper introduces a unique methodology to detect any conic equation parameters using the HT idea. The basis of the formulation here ...

We show that the complexity (the number of elements) of an optimal parabolic or conic spline approximating a smooth curve with nonvanishing curvature to within symmetric difference distance ε is c1 ε −1/4 + O(1), if the spline consists of parabolic arcs and c2 ε −1/5 +O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the affine curvature of ...

A simple geometric condition that defines the class of classical (stereographic, conic and cylindrical) conformal mappings from a sphere onto a plane is derived. The problem of optimization of computational grid for spherical domains is solved in an entire class of conformal mappings on spherical (geodesic) disk. The characteristics of computational grids of classical mappings are compared for ...

Wedescribe a polynomial-size conic quadratic reformulation for amachine-job assignment problemwith separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be applied to other problems with similar cost functions. Computational results demonstrate the effectiveness of the conic reformulation. © 2009 Elsevier B.V. All rights reserved.

Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation ∗ Mendes Oulamara† École Normale Supérieure 45 rue d’Ulm 75005 Paris, France [email protected] Arnaud J. Venet Carnegie Mellon University NASA Ames Research Center Moffett Field, CA 94035 [email protected] CAV 2015, 18-24 July 2015 Abstract The inference and the verification of numerical relationships among v...

A new approximation method for conic section by quartic Bézier curves is proposed. This method is based on the quartic Bézier approximation of circular arcs. We give the upper bound of Hausdorff distance between the conic section and the quartic Bézier curve, and also show that the approximation order is eight. And we prove that our approximation method has a smaller upper bound than previous q...