Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Linear Programming is strongly entwined with linear algebra, as are many of its generalizations under the heading of mathematical programming / convex optimization.

What analogies are there for convex optimization techniques outside of vector spaces dealt with in linear algebra. For example, Gaussian Elimination is generalized by Buchberger's algorithm for finding Groebner bases (or so I'm told); is there any algorithm that has a relationship with Buchberger's analogous to the Simplex Method's relationship with Gaussian Elimination?

share|improve this question
1  
did you already check out: math.berkeley.edu/~philipp/CAG-seminar.html –  Suvrit Oct 5 '11 at 9:20
add comment

1 Answer

Here is an explicit example: Max-plus control and tropical algebra

(using the above words as keywords leads to several other relevant results).

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.