# Tag: optimization

- Solving mixed integer programming (MIP) problems using Julia+JuMP
- Automated SDP relaxation of QCQPs in JuMP+Julia
- Tutorial on Optimization in Julia for MIT IAP course 15.S60: Computing in Optimization and Statistics (2022)
- Publication-quality plots in Julia using PGFPlotsX
- An improved lower-complexity bound for the class of convex and Lipschitz continuous functions
- Solving bilinear optimization problem using Alpine.jl
- Solving bilinear optimization problem using JuMP
- Constructing an interpolated function for the class of smooth strongly convex functions
- Solving transportation problems in Julia+JuMP
- Properties of smooth nonconvex interpolated functions
- Running Julia code on MIT Supercloud
- A lower-complexity bound for the class of convex and Lipschitz continuous functions
- How to solve semidefinite optimization problems in Julia
- Geometry of a prox-regular set
- Solving mixed-integer quadratic programming (MIQP) using Julia+JuMP
- Running parallel Julia code on MIT Supercloud
- Constructing an interpolated function for the class of smooth convex functions

© Shuvomoy Das Gupta. Website built with Franklin.jl and the Julia programming language.