Finding Euclidean Distance to a Convex Cone Generated by a Large Number of Discrete Points
نویسندگان
چکیده
Ali Fattahi Anderson School of Management, University of California, Los Angeles, Los Angeles, California 90095, [email protected] Sriram Dasu Marshall School of Business, University of Southern California, Los Angeles, Los Angeles, California 90089, [email protected] Reza Ahmadi Anderson School of Management, University of California, Los Angeles, Los Angeles, California 90095, [email protected]
منابع مشابه
مدلسازی صفحهای محیطهای داخلی با استفاده از تصاویر RGB-D
In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...
متن کاملExterior point algorithms for nearest points and convex quadratic programs
We consider the problem of finding the nearest point (by Euclidean distance) in a simplicial cone to a given point, and develop an exterior penalty algorithm for it. Each iteration in the algorithm consists of a single Newton step following a reduction in the value of the penalty parameter. Proofs of convergence of the algorithm are given. Various other versions of exterior penalty algorithms f...
متن کاملOn Seven Points in the Boundary of a Plane Convex Body in Large Relative Distances
By the relative distance of points p and q of a convex body C we mean the ratio of the Euclidean length of the segment pq to the half of the Euclidean length of a longest chord of C parallel to pq. We show that in the boundary of every plane convex body there exist seven points in pairwise relative distances at least 2 3 . We also give an estimate in case of three points. Finding sets of points...
متن کاملCharacterization of efficient points of the production possibility set under variable returns to scale in DEA
We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...
متن کاملThe fuzzy logic in air pollution forecasting model
In the paper a model to predict the concentrations of particulate matter PM10, PM2.5, SO2, NO, CO and O3 for a chosen number of hours forward is proposed. The method requires historical data for a large number of points in time, particularly weather forecast data, actual weather data and pollution data. The idea is that by matching forecast data with similar forecast data in the historical data...
متن کامل