This is an approach for solving convex optimization problems. An optimization problem is when you want to find the best option, or the fastest, or the most prof

This is an approach for solving convex optimization problems. An optimization problem is when you want to find the best option, or the fastest, or the most profitable. If you're asking questions with superlatives (most, best, fastest), you may be working on an optimization problem. Many optimization problems are NP Hard and cannot be solved in a reasonable amount of time. Convex optimization problems are a special subclass which can typically be solved efficiently (meaning in polynomial time). This paper provides a new approach to solving Convex Optimization problems for systems where other methods struggle.