Home
Convex Optimization
Convex Optimization Group
Calculus of Inequalities
Conic Independence
Convex Cones
Convex, Affine, Conic Hulls
Convex Functions
Convex Geometry
Distance Geometry
Distance Matrix Cone
Dual Cones
Duality Gap
Euclidean Distance Matrices
Elliptope and Fantope
Extreme Directions
Eigenvalues/Eigenvectors
Farkas Lemma
Face Recognition
Fifth Metric Property
Kissing Number
Linear Algebra
Linear Matrix Inequality
Matrix Calculus
Manifold Learning
Molecular Conformation
Positive Semidefinite Cone
Projection
Quasiconvex Functions
Rank Constraint
Semidefinite Programming
Schoenberg Criterion
Sensor Network Localization
Optimization News
SEO Consultant
Video
Wikimization
Zeros of Polynomials
Contact Us
Wikimization     Meboo     Video     News     Contact     See
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...

 

The Course

The Videos

See Inside

Convex Optimization

by Stephen Boyd 

& L. Vandenberghe 

Buy Book



See Figures

See Inside

Dattorro

by Dattorro

Buy Book



The Course

Bertsekas

by Dimitri Bertsekas 

Buy Book



See Inside

Hiriart-Urruty & Lemaréchal

by Hiriart-Urruty

& Lemaréchal

Buy Book



See Inside

Rockafellar

by Rockafellar

Buy Book



Optimization Newsletter
Subscription:

Email:

Receive HTML mailings?
Subscribe Unsubscribe