A Framework for Applying Subgradient Methods to Conic Optimization Problems
From MaRDI portal
Abstract: A framework is presented whereby a general convex conic optimization problem is transformed into an equivalent convex optimization problem whose only constraints are linear equations and whose objective function is Lipschitz continuous. Virtually any subgradient method can be applied to solve the equivalent problem. Two methods are analyzed.
This page was built for publication: A Framework for Applying Subgradient Methods to Conic Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6259777)
