On convergence rates of subgradient optimization methods
From MaRDI portal
Cites work
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- Convergence rate of the gradient descent method with dilatation of the space
- scientific article; zbMATH DE number 3171148 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- scientific article; zbMATH DE number 3371851 (Why is no real title available?)
- scientific article; zbMATH DE number 3402056 (Why is no real title available?)
- Minimization of Functionals in Normed Spaces
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions
- Note on an extension of “Davidon” methods to nondifferentiable functions
- On systems of inequalities with convex functions in the left sides
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The traveling-salesman problem and minimum spanning trees: Part II
- Validation of subgradient optimization
Cited in
(59)- Two ``well-known properties of subgradient optimization
- A Lagrangian relaxation approach to large-scale flow interception problems
- On a space extension algorithm for nondifferentiable optimization
- An automatic relaxation method for solving interval linear inequalities
- Assignment of tools to machines in a flexible manufacturing system
- Discrete minimax problem: Algorithms and numerical comparisons
- A decomposition technique for mixed integer programming problems
- Smooth minimization of non-smooth functions
- A surrogate heuristic for set covering problems
- On some difficult linear programs coming from set partitioning
- Solving the anti-covering location problem using Lagrangian relaxation
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Subgradient methods for sharp weakly convex functions
- A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem
- Modified Fejér sequences and applications
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- A variable target value method for nondifferentiable optimization
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach
- Faster subgradient methods for functions with Hölderian growth
- Lagrangian relaxation of the generic materials and operations planning model
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- A new method for strong-weak linear bilevel programming problem
- A simple nearly optimal restart scheme for speeding up first-order methods
- Scaling techniques for -subgradient methods
- Block stochastic gradient iteration for convex and nonconvex optimization
- Capacitated disassembly scheduling with random demand
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints
- A generalization of Polyak's convergence result for subgradient optimization
- Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- Survey of Bundle Methods for Nonsmooth Optimization
- The edge-disjoing steiner problem in graphs
- scientific article; zbMATH DE number 7370566 (Why is no real title available?)
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
- Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain
- Nonconvex Robust Low-Rank Matrix Recovery
- Two-direction subgradient method for non-differentiable optimization problems
- A Benders decomposition based heuristic for the hierarchical production planning problem
- Essentials of numerical nonsmooth optimization
- A modified subgradient algorithm for Lagrangean relaxation
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Essentials of numerical nonsmooth optimization
- Stochastic algorithms with geometric step decay converge linearly on sharp functions
- Polyak minorant method for convex optimization
- Efficient randomized block Kaczmarz method for linear feasibility
- Accelerating level-value adjustment for the Polyak stepsize
- Nonlinear tomographic reconstruction via nonsmooth optimization
- Optimizing coarse propagators in parareal algorithms
- Computationally efficient and statistically optimal robust high-dimensional linear regression
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Large-scale mixed integer programming: Benders-type heuristics
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- Successive relaxation method for minimization of functionals and some efficiency estimates
This page was built for publication: On convergence rates of subgradient optimization methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145170)
