<--- Back to Details
First PageDocument Content
Convex analysis / Convex geometry / Euclidean plane geometry / Discrete geometry / Convex function / Polygon / Convex set / Quadrilateral / Happy Ending problem / Mathematics / Geometry / Mathematical analysis
Date: 2002-11-30 04:02:34
Convex analysis
Convex geometry
Euclidean plane geometry
Discrete geometry
Convex function
Polygon
Convex set
Quadrilateral
Happy Ending problem
Mathematics
Geometry
Mathematical analysis

Add to Reading List

Source URL: www.renyi.hu

Download Document from Source Website

File Size: 1,71 MB

Share Document on Facebook

Similar Documents

MathQuest: Linear Algebra Affine and Convex Combinations 1. How do you describe the set of all affine combinations of the vectors (1, 0) and (0, 1)? (a) A point (b) A line segment

DocID: 1v0rO - View Document

A disjunctive convex programming approach to the pollution routing problem Ricardo Fukasawa∗, Qie He†, Yongjia Song‡ Abstract The pollution routing problem (PRP) aims to determine a set of routes and speed over eac

DocID: 1sYbq - View Document

III.2 Convex Set Systems III.2 53

DocID: 1sWmE - View Document

Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit

DocID: 1sry5 - View Document

Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit

DocID: 1rkf9 - View Document