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 Calculus of Inequalities
Calculus of Inequalities

Convex Analysis is the calculus of inequalities while Convex Optimization is its application.

                   alternating projection

For example, myriad alternative systems of linear inequality can be explained in terms of pointed closed convex cones and their duals.

As another example, the general first-order necessary and sufficient condition for optimality of a solution to a minimization problem, with real differentiable convex objective function, can be expressed as an inequality over a convex feasible set.

For one last example from an infinitude, the Schoenberg criterion for determining existence of a Euclidean distance matrix is accurately interpreted as a discretized membership relation (a generalized inequality) between the EDM cone and its ordinary dual.

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