Two ``well-known properties of subgradient optimization

DOI10.1007/s10107-007-0148-yzbMath1180.90179MaRDI QIDQ1016352

Kurt M. Anstreicher, Laurence A. Wolsey

Publication date: 5 May 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0148-y

Mathematics Subject Classification ID

90C25: Convex programming

90C06: Large-scale problems in mathematical programming

90C05: Linear programming

Related Items

Primal-dual subgradient methods for convex problems, Using underapproximations for sparse nonnegative matrix factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional subgradient optimization -- theory and applications
• Convergence of some algorithms for convex minimization
• On some difficult linear programs coming from set partitioning
• The volume algorithm revisited: relation with bundle methods
• The volume algorithm: Producing primal solutions with a subgradient method
• Ergodic, primal convergence in dual subgradient schemes for convex programming
• Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
• A primal-proximal heuristic applied to the French unit-commitment problem
• On convergence rates of subgradient optimization methods
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• Ergodic convergence in subgradient optimization
• Validation of subgradient optimization