Primal-Dual Optimization
Overview
Primal-dual optimization solves constrained problems by improving a candidate solution while adjusting multipliers to reflect constraint violations. Common approaches include primal-dual hybrid gradient, ADMM, interior-point methods, and augmented Lagrangian methods, used in settings from large-scale linear programs to distributed control and online resource allocation. Researchers also learn solver parameters or multiplier-update policies, and apply these methods to constrained generation and machine learning. A central challenge is balancing speed and reliable feasibility when problems are nonconvex, noisy, or poorly conditioned, since many guarantees depend on convexity or regularity assumptions.
Latest papers
53 papers10 papers in the last four weeks, up 100% on the four weeks before. 0.1% of all new papers.