On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
From MaRDI portal
Publication:1697974
DOI10.1007/S12532-017-0120-7zbMATH Open1393.90072OpenAlexW2611825068WikidataQ118165429 ScholiaQ118165429MaRDI QIDQ1697974FDOQ1697974
Authors: Antonio Frangioni, Bernard Gendron, E. Gorgone 
Publication date: 21 February 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/851793
Recommendations
- ``Efficient subgradient methods for general convex optimization
- Subgradient method for minimization of convex functionals and some efficiency bounds
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- A computational evaluation of two subgradient search methods
- The efficiency of ballstep subgradient level methods for convex optimization
- Efficiency of inexact fixed point quasiconvex subgradient method
- Accelerating the convergence of subgradient optimisation
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
computational analysisLagrangian relaxationsubgradient methodsnondifferentiable optimizationmulticommodity network design
Cites Work
- Smooth minimization of non-smooth functions
- Two ``well-known properties of subgradient optimization
- Primal-dual subgradient methods for convex problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Excessive Gap Technique in Nonsmooth Convex Minimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Generalized Bundle Methods
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- New developments in the primal-dual column generation technique
- A library for continuous convex separable quadratic knapsack problems
- Comparison of bundle and classical column generation
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- The Cutting-Plane Method for Solving Convex Programs
- A stabilized structured Dantzig-Wolfe decomposition method
- Title not available (Why is that?)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- A geometric study of dual gaps, with applications
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- Incremental subgradient methods for nondifferentiable optimization
- The volume algorithm: Producing primal solutions with a subgradient method
- Convergence of a simple subgradient level method
- Minimization of unsmooth functionals
- Universal gradient methods for convex optimization problems
- Error stability properties of generalized gradient-type algorithms
- A family of subgradient-based methods for convex optimization problems in a unifying framework
- Smoothing and first order methods: a unified framework
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- A variable smoothing algorithm for solving convex optimization problems
- On the choice of explicit stabilizing terms in column generation
- A variable target value method for nondifferentiable optimization
- New approaches for optimizing over the semimetric polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Multicommodity network flows: The impact of formulation on decomposition
- The volume algorithm revisited: relation with bundle methods
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Convergence analysis of deflected conditional approximate subgradient methods
- Conditional subgradient optimization -- theory and applications
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Projected subgradient minimization versus superiorization
- On embedding the volume algorithm in a variable target value method.
- A generalized subgradient method with relaxation step
- On improvements to the analytic center cutting plane method
- A modified subgradient algorithm for Lagrangean relaxation
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- The efficiency of ballstep subgradient level methods for convex optimization
- A nonmonotone proximal bundle method with (potentially) continuous step decisions
- Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
Cited In (10)
- A computational evaluation of two subgradient search methods
- Dynamic smoothness parameter for fast gradient methods
- Incremental bundle methods using upper models
- Lagrangian relaxation for SVM feature selection
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
- A method for convex minimization based on translated first-order approximations
- A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
Uses Software
This page was built for publication: On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1697974)
