Two ``well-known properties of subgradient optimization
From MaRDI portal
Publication:1016352
DOI10.1007/S10107-007-0148-YzbMATH Open1180.90179OpenAlexW2119273405MaRDI QIDQ1016352FDOQ1016352
Authors: 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
Recommendations
- A new notion of generalized subgradients and its properties
- On Convergence Properties of a Subgradient Method
- Subgradient method for minimization of convex functionals and some efficiency bounds
- ?-Subgradient mapping and the problem of convex optimization
- A note on the convergence of subgradient optimization methods
- Two-direction subgradient method for non-differentiable optimization problems
- Dualization of subgradient conditions for optimality
- ``Efficient subgradient methods for general convex optimization
- scientific article; zbMATH DE number 798859
- A generalization of Polyak's convergence result for subgradient optimization
Convex programming (90C25) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On convergence rates of subgradient optimization methods
- Convergence of some algorithms for convex minimization
- 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
- Title not available (Why is that?)
- Validation of subgradient optimization
- A primal-proximal heuristic applied to the French unit-commitment problem
- The volume algorithm: Producing primal solutions with a subgradient method
- The volume algorithm revisited: relation with bundle methods
- Conditional subgradient optimization -- theory and applications
- On some difficult linear programs coming from set partitioning
- Ergodic convergence in subgradient optimization
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
Cited In (27)
- Planning online advertising using Gini indices
- Title not available (Why is that?)
- Convergence analysis of deflected conditional approximate subgradient methods
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- Large-scale unit commitment under uncertainty: an updated literature survey
- Aggregate subgradient method for nonsmooth DC optimization
- Divide to conquer: decomposition methods for energy optimization
- A generalization of Polyak's convergence result for subgradient optimization
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- Using underapproximations for sparse nonnegative matrix factorization
- Column elimination for capacitated vehicle routing problems
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- Accelerating the convergence of subgradient optimisation
- An infeasible-point subgradient method using adaptive approximate projections
- Primal convergence from dual subgradient methods for convex optimization
- Asynchronous Lagrangian scenario decomposition
- Large-scale unit commitment under uncertainty
- A Lagrangian-ACO matheuristic for car sequencing
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Subgradient method for nonconvex nonsmooth optimization
- Primal subgradient methods with predefined step sizes
- An inexact primal-dual algorithm for semi-infinite programming
- Primal-dual subgradient methods for convex problems
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- An effective line search for the subgradient method
This page was built for publication: Two ``well-known properties of subgradient optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016352)
