Solvers for unconstrained and constrained convex functions.

Machine Learning and Analysis of Big Data course, Computer Science M.Sc., Ben Gurion University of the Negev, 2020

This repository contains the MTech coursework in Amrita College of Engineering, Bengaluru. It has some labs, assignments and project work related to courses in 1st Semester

中山大学最优化理论 (2018 春)：求解 LASSO 模型、求解 MNIST 上的 Logistic 回归

Source code of the numerical experiments presented in "Energy-Efficient Edge-Facilitated Wireless Collaborative Computing using Map-Reduce" by Antoine Paris, Hamed Mirghasemi, Ivan Stupia and Luc Vandendorpe (presented at SPAWC19).

Solving a convex problem with affine equality constrains with CVX and Newton algorithm

optopy is a prototyping and benchmarking Python framework for optimization, both static and dynamic, centralized and distributed

TSP is a classic optimization problem in computer science and operations research. In this essay, we playfully apply TSP to the case where Elon Musk, the visionary entrepreneur of SpaceX, wishes to visit all the planets of our solar system with minimum cost.

Pythonic Aerospace Vehicle Designer - A highly modular conceptual Aircraft designer, coupling geometric global optimization with Raymer, Roskam, Levis and other cool workflows

A naive Algorithm that uses People Detection and Convex Hull as subroutines to solve this problem: "Given an image of people standing randomly, how many people can be a part of some queue {Q}. A queue {Q} is basically a line(y = mx + c) that minimises a custom loss function. "

Notes for EE364A: Convex Optimization I by Stanford University

General tools for optimizing SVM dual and similar problems.

MVA Assignment - Convex Optimization - Implementation of Lasso with barrier method

Animations for a presentation on discrete convex analysis.

Solutions to Course in Advanced Programming and Optimization Algorithms

This repository contains the implementation of convex optimization algorithms using gradient descent and Newton's method in Python. These algorithms can be used to solve optimization problems involving convex functions efficiently.

A repository containing solutions to Programming Assignments given in MTH courses to undergrads at IIIT-Delhi.

A LLM-integrated code generator for embedded convex optimization, addressing the challenges engineers face in translating complex mathematical expressions with convex objectives into efficient C code for embedded devices.