Two ``well-known properties of subgradient optimization

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

Laurence A. Wolsey, Kurt M. Anstreicher

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

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items

A relax-and-cut framework for large-scale maximum weight connected subgraph problems, Subgradient method for nonconvex nonsmooth optimization, Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis, Column elimination for capacitated vehicle routing problems, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Planning Online Advertising Using Gini Indices, An infeasible-point subgradient method using adaptive approximate projections, Large-scale unit commitment under uncertainty: an updated literature survey, Asynchronous Lagrangian scenario decomposition, Aggregate subgradient method for nonsmooth DC optimization, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, Using underapproximations for sparse nonnegative matrix factorization, Divide to conquer: decomposition methods for energy optimization, Primal-dual subgradient methods for convex problems, A fast exact method for the capacitated facility location problem with differentiable convex production costs, A Lagrangian-ACO matheuristic for car sequencing, A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem, An inexact primal-dual algorithm for semi-infinite programming, Primal convergence from dual subgradient methods for convex optimization, Large-scale unit commitment under uncertainty, A decomposition method for large scale MILPs, with performance guarantees and a power system application

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