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 Dual Cones
Dual Cones

These three concepts, dual cone, generalized inequality, and biorthogonal expansion, are inextricably melded; meaning, it is difficult to completely discuss one without mentioning the others.  The dual cone is critical in tests for convergence by contemporary primal/dual methods for numerical solution of conic problems. For unique minimum-distance projection on a closed convex cone K, the negative dual cone plays the role that orthogonal complement plays for subspace projection.  Indeed, the dual cone is the algebraic complement.

   dual monotone cones

One way to think of a pointed closed convex cone is as a new kind of coordinate system whose basis is generally nonorthogonal; a conic system, very much like the familiar Cartesian system whose analogous cone is the first quadrant or nonnegative orthant.

Generalized inequality is a formalized means to determine membership to any pointed closed convex cone, while biorthogonal expansion is simply a formulation for expressing coordinates in a pointed conic coordinate system. 

When cone K is the nonnegative orthant, then these three concepts come into alignment with the Cartesian prototype; biorthogonal expansion becomes orthogonal expansion.

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