论文信息 - Preliminary computational experience with a descent level method for convex nondifferentiable optimization

Preliminary computational experience with a descent level method for convex nondifferentiable optimization

We report on numerical tests with our recently introduced descent level bundle method for convex minimization. The test problems include standard nonsmooth problems, eigenvalue problems, and Lagrangian duals of traveling salesman, capacitated lotsizing, hierarchical production planning and unit commitment problems.

[1] K. Kiwiel. Finding normal solutions in piecewise linear programming , 1995 .

[2] H. W. Zaininger,et al. Synthetic electric utility systems for evaluating advanced technologies. Final report , 1977 .

[3] Per Olov Lindberg,et al. A descent proximal level bundle method for convex nondifferentiable optimization , 1995, Oper. Res. Lett..

[4] K. Kiwiel. The Efficiency of Subgradient Projection Methods for Convex Optimization , 1996 .

[5] Krzysztof C. Kiwiel,et al. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities , 1995, Math. Program..

[6] Yurii Nesterov,et al. New variants of bundle methods , 1995, Math. Program..

[7] L Van Wassenhove,et al. Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem , 1985 .

[8] Jonathan F. Bard,et al. Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation , 1988, Oper. Res..

[9] Allen J. Wood,et al. Power Generation, Operation, and Control , 1984 .

[10] K. Kiwiel. A Cholesky dual method for proximal piecewise linear programming , 1994 .

[11] K. Kiwiel. A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems , 1989 .

[12] S. Graves. Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems , 1982 .

[13] Krzysztof C. Kiwiel,et al. Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..