On convergence rates of subgradient optimization methods

DOI10.1007/BF01584346zbMath0368.90119OpenAlexW2008164266MaRDI QIDQ4145170

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584346

Mathematics Subject Classification ID

Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)

Related Items (52)

Subgradient methods for sharp weakly convex functions ⋮ Capacitated disassembly scheduling with random demand ⋮ A surrogate heuristic for set covering problems ⋮ On some difficult linear programs coming from set partitioning ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints ⋮ Solving the anti-covering location problem using Lagrangian relaxation ⋮ Spectral projected subgradient with a momentum term for the Lagrangean dual approach ⋮ Assignment of tools to machines in a flexible manufacturing system ⋮ Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization ⋮ A generalization of Polyak's convergence result for subgradient optimization ⋮ Unnamed Item ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ First-order algorithm with ${\mathcal{O}(\ln(1/\epsilon))}$ convergence for ${\epsilon}$-equilibrium in two-person zero-sum games ⋮ A simple nearly optimal restart scheme for speeding up first-order methods ⋮ Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. ⋮ Discrete minimax problem: Algorithms and numerical comparisons ⋮ Successive relaxation method for minimization of functionals and some efficiency estimates ⋮ A variable target value method for nondifferentiable optimization ⋮ The edge-disjoing steiner problem in graphs ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ A modified subgradient algorithm for Lagrangean relaxation ⋮ A decomposition technique for mixed integer programming problems ⋮ Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain ⋮ A Lagrangian relaxation approach to the edge-weighted clique problem ⋮ A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem ⋮ Two-direction subgradient method for non-differentiable optimization problems ⋮ A Benders decomposition based heuristic for the hierarchical production planning problem ⋮ Train timetabling for an urban rail transit line using a Lagrangian relaxation approach ⋮ Modified Fejér sequences and applications ⋮ Smooth minimization of non-smooth functions ⋮ A new method for strong-weak linear bilevel programming problem ⋮ Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Faster subgradient methods for functions with Hölderian growth ⋮ Nonconvex Robust Low-Rank Matrix Recovery ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ Two ``well-known properties of subgradient optimization ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ Scaling Techniques for $\epsilon$-Subgradient Methods ⋮ A Lagrangian relaxation approach to large-scale flow interception problems ⋮ A projection method for least-squares solutions to overdetermined systems of linear inequalities ⋮ Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence ⋮ Parallel subgradient algorithm with block dual decomposition for large-scale optimization ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ Convergence of a cyclic ellipsoid algorithm for systems of linear equalities ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ Large-scale mixed integer programming: Benders-type heuristics ⋮ On a space extension algorithm for nondifferentiable optimization ⋮ An automatic relaxation method for solving interval linear inequalities ⋮ Essentials of numerical nonsmooth optimization ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems

Cites Work

This page was built for publication: On convergence rates of subgradient optimization methods