Ganita

All Things Markov

A theoretical, graphical and computational exploration of stochastic modelling.
View

Nonlinear Programming: Methods for Unconstrained Optimization

A theoretical, graphical and computational exploration of unconstrained nonlinear optimization.
View

Dimensionality Reduction

A theoretical and computational exploration of dimensionality reduction from a projection-optimization point of view.
View

Measures hidden in Probability

A synopsis of measure theoretic take on probability.
View

Simulating Convergence

Simple computational simulations to build intuition on Convergence.
View

Maximum Clique Problem as an LP

Maximum Clique Problem was one of the 21 original NP-hard problems enumerated by Richard Karp in 1972. Here, I model it using a Linear Programming approach. In particular, reduce the clique problem to an Independent set problem and solve it by appying linear relaxation and column generation.
View

Predictive maintenance: A time series approach

Comparision of a statistical time series vs a deep learning approach for solving prognostic problems.
View