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.
Approximation algorithms deliver provably near-optimal solutions for NP-hard optimization problems within guaranteed factors.