Groups
Category
Interior point methods solve constrained optimization by replacing hard constraints with a smooth barrier that becomes infinite at the boundary, keeping iterates strictly inside the feasible region.
Lagrangian duality turns a constrained minimization problem into a related maximization problem that provides lower bounds on the original objective.