# Truncated Newton Method-Software and Convex Optimization-Lecture Slides

Dr. Hanumant Chawd delivered this lecture at Alagappa University for Convex Optimization course. Its main points are: Truncated, Newton, Method, Approximate, Truncated, Convex, SPD, Cholesky, Factorization, BFGS

# Notes on Decomposition Methods-Optimization Techniques-Lecture Notes

Prof. Asit Maddukuri provided this handout for Convex Optimization course at Aligarh Muslim University. Its main points are: Decomposition, Methods, Primal, Dual, Constraints, Coupling, Framework, Rate, Control, Commodity, Network, Flow

Prof. Chhaayank Buhpathi assigned this task to do at home for Convex Optimization course at Aliah University. It includes: Circle, Packing, Area, Bound, Sequential, Convex, Programming, Numerical, Smart, Grid, Device, Coordination

# Distributed Lasso

Prof. Chhaayank Buhpathi assigned this task to do at home for Convex Optimization course at Aliah University. It includes: Distributed, Lasso, Primal, Decomposition, Dual, Numerical, Operators, Diode, Cayley

# Douglas Rachford Splitting For LP Feasibility

Prof. Chhaayank Buhpathi assigned this task to do at home for Convex Optimization course at Aliah University. It includes: Douglas, Rachford, Splitting, LP, Feasibility, Fixed, Point, Euclidean, Convex

# Destination’s Local Neighborhood - Combinatorial Optimization - Homework

Main points of this homework are: Destination’s Local Neighborhood, Weighted Edges, Route from Destination, K-Spanner of Network, Shortest Distances, Optimal Route, Subset of Edges, Original Network, Capacity Function, Lower Bounds

# Maximum Weight Matching - Combinatorial Optimization - Homework

Main points of this homework are: Maximum Weight Matching, Complete Bipartite Graph, Adjacency Matrix, Dual Algorithm, Bottleneck Matching Problem, Perfect Matching, Polynomial Time Algorithm, Bin Packing Problem, Bin Capacity

# Necessary and Sufficient Conditions - Combinatorial Optimization - Homework

Main points of this homework are: Necessary and Sufficient Conditions, Optimal Solution, Net Profits, Standard Form, Perfect Matching, K-Regular Bipartite Graph, Bipartite Simple Graph, Define Matrix, Polynomial Time Algorithm

# Simplex Method - Combinatorial Optimization - Homework

Main points of this homework are: Simplex Method, Maximum Vertical Distance, Form of Pairs, Measurements of Variable, Simplex Algorithm, Simplex Algorithm, Feasible Point, Positive Distance, Maximum Flow Problem, Directed Graph

# Subset of Vertices - Combinatorial Optimization - Homework

Main points of this homework are: Subset of Vertices, Minimum Edge Cover, Size of Maximum Matching, Complementary Slackness, Max-Flow–Min-Cut Theorem, Minimum Cut Separating, Dual Linear Program, Capacity Function, Feasible Point