Lagrangian Relaxation via Ballstep Subgradient Methods
暂无分享,去创建一个
[1] K. Kiwiel. The Efficiency of Subgradient Projection Methods for Convex Optimization , 1996 .
[2] Michael Patriksson,et al. Ergodic, primal convergence in dual subgradient schemes for convex programming , 1999, Mathematical programming.
[3] Hanif D. Sherali,et al. A class of convergent primal-dual subgradient algorithms for decomposable convex programs , 1986, Math. Program..
[4] D. Bertsekas,et al. Incremental subgradient methods for nondifferentiable optimization , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).
[5] J. Gondzio,et al. Using an interior point method for the master problem in a decomposition approach , 1997 .
[6] Torbjörn Larsson,et al. The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization , 1999, Math. Oper. Res..
[7] Stefan Feltenmark,et al. Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems , 1999, SIAM J. Optim..
[8] Torbjörn Larsson,et al. A dual scheme for traffic assignment problems , 1997 .
[9] Francisco Barahona,et al. The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..
[10] Torbjörn Larsson,et al. Applications of Simplicial Decomposition with Nonlinear Column Generation to Nonlinear Network Flows , 1997 .
[11] Nelson Maculan,et al. The volume algorithm revisited: relation with bundle methods , 2002, Math. Program..
[12] David E. Boyce,et al. Comparison of Disaggregate Simplicial Decomposition and Frank-Wolfe Algorithms for User-Optimal Route Choice , 1998 .
[13] K. Kiwiel. Efficiency of Proximal Bundle Methods , 2000 .
[14] O. Nelles,et al. An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.
[15] Arkadi Nemirovski,et al. The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography , 2001, SIAM J. Optim..
[16] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[17] Giorgio Gallo,et al. Shortest path algorithms , 1988 .
[18] Hanif D. Sherali,et al. Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs , 1996, Oper. Res. Lett..
[19] Krzysztof C. Kiwiel,et al. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities , 1995, Math. Program..
[20] Egon Balas,et al. A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..
[21] Philippe Mahey,et al. A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .
[22] K. Kiwiel,et al. Parallel Subgradient Methods for Convex Optimization , 2001 .
[23] M. Patriksson,et al. Ergodic convergence in subgradient optimization , 1998 .
[24] T. Larsson,et al. A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows , 1997 .
[25] Krzysztof C. Kiwiel,et al. Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..
[26] M. Fukushima. On the dual approach to the traffic assignment problem , 1984 .
[27] Francisco Barahona,et al. On some difficult linear programs coming from set partitioning , 2002, Discret. Appl. Math..
[28] Fabián A. Chudak,et al. Solving Large Scale Uncapacitated Facility Location Problems , 2000 .
[29] Jean-Louis Goffin,et al. The ellipsoid method and its predecessors , 1986 .
[30] Jacek Gondzio,et al. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..
[31] Yurii Nesterov,et al. New variants of bundle methods , 1995, Math. Program..
[32] Dimitri P. Bertsekas,et al. Network optimization : continuous and discrete models , 1998 .
[33] James V. Burke,et al. Characterization of solution sets of convex programs , 1991, Oper. Res. Lett..
[34] Antonio Sassano,et al. A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..
[35] Naum Zuselevich Shor,et al. Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.
[36] Y. Censor,et al. Inherently parallel algorithms in feasibility and applications , 1997 .
[37] Krzysztof C. Kiwiel,et al. Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization , 2003, SIAM J. Optim..
[38] Boris Polyak. Minimization of unsmooth functionals , 1969 .
[39] Vivek S. Borkar,et al. Distributed Asynchronous Incremental Subgradient Methods , 2001 .
[40] Masao Fukushima,et al. A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS , 1984 .