Pages that link to "Item:Q3768688"

The following pages link to A generalization of Polyak's convergence result for subgradient optimization (Q3768688):

Displaying 20 items.

• An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
• Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
• The equal flow problem (Q1108179) (← links)
• Variable target value subgradient method (Q1174455) (← links)
• The \(K\)-coverage concentrator location problem (Q1193145) (← links)
• Configuration of fully replicated distributed database system over wide area networks (Q1197781) (← links)
• A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
• Inexact subgradient methods with applications in stochastic programming (Q1315432) (← links)
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• On some difficult linear programs coming from set partitioning (Q1348247) (← links)
• Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
• Planning capacity and safety stocks in a serial production-distribution system with multiple products (Q2029035) (← links)
• Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
• Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
• (Q3384760) (← links)
• Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
• A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
• A new forced LMS-based adaptive algorithm utilizing the principle of potential energy (Q5952959) (← links)