Pages that link to "Item:Q4145170"

The following pages link to On convergence rates of subgradient optimization methods (Q4145170):

Displaying 50 items.

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