Home
Wikimization
Contact Us
Accumulator error feedback
CVX Download
Calculus of Inequalities
Rick Chartrand
Chromosome Structure EDM
Complementarity problem
Compressive Sampling
Compressed Sensing
Conic Independence
Convex Cones
Convex Functions
Convex Geometry
Convex, Affine, Conic: Hulls
Convex Iteration
Convex Optimization
Convex Optimization Group
Dattorro PC Optimization
Dattorro Supercomputer
Distance Geometry
Distance Matrix Cone
Dual Cones
Duality Gap
Eigenvalues/Eigenvectors
Elliptope and Fantope
Euclidean Distance Matrices
EDM cone faces
Extreme Directions
Face Recognition
Farkas Lemma
Fermat point
Fifth Metric Property
Jensen's Inequality
Jobs in Optimization
Kissing Number
Harold W. Kuhn
Linear Algebra
Linear Matrix Inequality
Manifold Learning
MATLAB for Optimization
Matrix Calculus
Molecular Conformation
Moreau's theorem
Isaac Newton
Angelia Nedic
Open Problems
Positive Matrix Factorization
Positive Semidefinite Cone
Projection
Projection on Cone
Proximity Problems
PY4SCIENCE
Quasiconvex Functions
Rank Constraint
Rockafellar
Justin Romberg
Michael Saunders
Schoenberg Criterion
Semidefinite Programming
Sensor Network Localization
Smallest Simplex
Systems Optimization Lab
Stanford SOL
Talks on Optimization
Joshua Trzasko
Video
Wikimization     Meboo     SOL      Video     CVX     Contact     
Felice crystal
Home arrow Convex, Affine, Conic: Hulls
Convex, Affine, Conic Hulls

The hull of a boat rests in the water; it contains the occupants and cargo. 

Hulls are a fundamental concept in convex geometry.  The convex hull of two points, for example, comprises those points and the line segment between them.  Their affine hull is the unique line containing them, while the conic hull is the union of all rays, emanating from the origin, intersecting the convex hull of those two points.

                           convex hull

Any closed convex set containing no lines can be expressed as the convex hull of its extreme points and extreme rays.

The conic hull of any finite-length list forms a polyhedral cone, the smallest closed convex cone that contains the list.

Dimension of an arbitrary set S is the dimension of its affine hull, which is the same as dimension of the subspace parallel to that affine set.  The subspace of symmetric matrices is the affine hull of the cone of positive semidefinite matrices.

Read more...

 
Course,   Video
Convex Optimization
     convex optimization
Stephen Boyd 
L. Vandenberghe 


Dattorro      convex optimization Euclidean distance geometry 2ε
Dattorro


Course
Bertsekas
     books by Bertsekas
Dimitri Bertsekas 


See Inside Hiriart-Urruty & Lemaréchal
Hiriart-Urruty
& Lemaréchal


See Inside
Rockafellar Rockafellar