Home
Wikimization
Contact Us
Accumulator error feedback
CVX Download
Calculus of Inequalities
Chromosome Structure EDM
Complementarity problem
Compressive Sampling
Compressed Sensing
Conic Independence
Convex Cones
Convex Functions
Convex Geometry
Convex Optimization
Convex Iteration
Convex, Affine, Conic Hulls
Convex Optimization Group
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
Michael Saunders
Schoenberg Criterion
Semidefinite Programming
Sensor Network Localization
SEO Consultant
Smallest Simplex
Systems Optimization Lab
Talks on Optimization
Video
Wikimization     Meboo     SOL      Video     CVX     Contact     
Felice crystal
Home arrow Conic Independence
Conic Independence

Conic independence is introduced as a natural extension to linear and affine independence; a new tool in convex analysis most useful for manipulation of cones.

   conic affine linear independence

Perhaps the most useful application of conic independence is determination of the intersection of closed convex cones from their halfspace-descriptions, or representation of the sum of closed convex cones from their vertex-descriptions.

A halfspace-description for the intersection of any number of closed convex cones K_i can be acquired by pruning normals; specifically, only the conically independent normals from the aggregate of all the halfspace-descriptions need be retained.

Generators for the sum of any number of closed convex cones K_i can be determined by retaining only the conically independent generators from the aggregate of all the vertex-descriptions.

Such conically independent sets are not necessarily unique or minimal.

Read more...

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


Dattorro      convex optimization & Euclidean distance geometry
Dattorro


Course
Bertsekas
     books by Bertsekas
Dimitri Bertsekas 


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


See Inside
Rockafellar Rockafellar

     
Optimization Newsletter
Subscription:

Email:

Receive HTML mailings?
Subscribe Unsubscribe