Computational Convex Analysis (CCA) studies the computation of convex operators commonly used in convex analysis. CCA allows researchers to visualize non-trivial convex transforms and build an intuition from these examples. Using the convexity and structure of piecewise linear cubic (PLC) functions as a model, the foundation for a new CCA toolbox has been implemented. The CCA toolbox is built in MATLAB and includes extensive test coverage and examples. In addition, it is free and open source. The CCA toolbox provides several plotting methods to visualize PLC functions and their properties. Plotting the domain of a PLC function is a useful tool for both research and visualizing the correctness of computed output. Within a PLC function, any...
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodular...
Convex optimization is a branch of mathematics dealing with non-linear optimization problems with ad...
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodular...
The objective of this thesis is to develop efficient algorithms and data structures appropriate to s...
At the core of Convex Analysis and its applications are a collection of frequently used operators fo...
This thesis documents the data structure and functions pertaining to storing piecewise linear-cubic ...
Convex optimization is a branch of mathematics dealing with non-linear optimization problems with ad...
After introducing concepts from convex analysis, we study how to continuously transform one convex f...
Computing explicitly the ε-subdifferential of a proper function amounts to computing the level set o...
The class of piecewise linear-quadratic (PLQ) functions is a very important class of functions in co...
Abstract. Computational Convex Analysis algorithms have been rediscovered several times in the past ...
Computational Convex Analysis focuses on computing the convex operators which are used very often i...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
Optimization is a branch of mathematics dealing with the selection of the best element(s) (based on ...
First, we consider how to efficiently determine whether a piecewise-defined function in 2D is convex...
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodular...
Convex optimization is a branch of mathematics dealing with non-linear optimization problems with ad...
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodular...
The objective of this thesis is to develop efficient algorithms and data structures appropriate to s...
At the core of Convex Analysis and its applications are a collection of frequently used operators fo...
This thesis documents the data structure and functions pertaining to storing piecewise linear-cubic ...
Convex optimization is a branch of mathematics dealing with non-linear optimization problems with ad...
After introducing concepts from convex analysis, we study how to continuously transform one convex f...
Computing explicitly the ε-subdifferential of a proper function amounts to computing the level set o...
The class of piecewise linear-quadratic (PLQ) functions is a very important class of functions in co...
Abstract. Computational Convex Analysis algorithms have been rediscovered several times in the past ...
Computational Convex Analysis focuses on computing the convex operators which are used very often i...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
Optimization is a branch of mathematics dealing with the selection of the best element(s) (based on ...
First, we consider how to efficiently determine whether a piecewise-defined function in 2D is convex...
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodular...
Convex optimization is a branch of mathematics dealing with non-linear optimization problems with ad...
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodular...