New bundle methods for solving Lagrangian relaxation dual problems

Journal of Optimization Theory and Applications

Volumn 113, Issue 2, 2002, Pages 373-397

  Zhao, X ^a   Luh, P B ^b  

^a i2 Technologies   (United States)

^b C AND EN   (United States)

Author keywords

bundle methods; Lagrangian relaxation; manufacturing scheduling; nonsmooth optimization

Indexed keywords

DYNAMIC PROGRAMMING; FUZZY INFERENCE; INTEGER PROGRAMMING; JOB SHOP SCHEDULING; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

BUNDLE METHODS; DUAL PROBLEM; LAGRANGIAN RELAXATIONS; LINE SEARCHES; MANUFACTURING SCHEDULING; MINIMUM SOLUTION; NONSMOOTH OPTIMIZATION; NONSMOOTH OPTIMIZATION PROBLEMS; RELAXED PROBLEM; SUBGRADIENT;

QUADRATIC PROGRAMMING;

EID: 0036250973     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014839227049     Document Type: Article

References (14)

1. GEOFFRION, M., Lagrangian Relaxation for Integer Programming, Mathematical Programming Studies, North Holland, Amsterdam, Netherlands, pp. 82-114, 1974.
2. BERTSEKAS, D. P., Nonlinear Programming, 2nd Edition, Athena Scientific, Belmont, Massachusetts, 1999.
3. ZHAO, X., LUH, P. B., and WANG, J., Surrogate Gradient Algorithm for Lagrangian Relaxation, Journal of Optimization Theory and Applications, Vol. 100, pp. 699-712, 1999.
4. KASKAVELIS, C. A., and CARAMANIS, M. C., Efficient Lagrangian Relaxation Algorithms for Industry Size Job-Shop Scheduling Problems, IIE Transactions, Vol. 30, pp. 1085-1097, 1998.
5. HIRIART-URRUTY, J. B., and LEMARECHAL, C., Convex Analysis and Minimization Algorithms, Vols. 1 and 2, Springer Verlag, Berlin, Germany, 1993.
6. NEMHAUSER, G., and WOLSEY, L., Integer and Combinatorial Optimization, John Wiley and Sons, New York, NY, 1988.
7. HELD, M., WOLFE, P., and CROWDER, H., Validation of Subgradient Optimization, Mathematical Programming, Vol. 6, pp. 62-88, 1974.
8. KIWIEL, K. C., Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization, SIAM Journal on Optimization, Vol. 6, pp. 227-249, 1996.
9. KOHL, N. and MADSEN, O. B. G., An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation, Operations Research, Vol. 45, pp. 395-406, 1997.
10. MIFFLIN, R., SUN, D., and QI, L., Quasi-Newton Bundle-Type Methods for Non-differentiable Convex Optimization, SIAM Journal on Optimization, Vol. 8, pp. 583-603, 1998.
11. WANG, J., LUH, P. B., ZHAO, X., and WANG, J., An Optimization-Based Algorithm for Job Shop Scheduling, Sadhana, Vol. 22, pp. 241-256, 1997.
12. BELLMAN, R., Applied Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1957.
13. KIWIEL, K. C., Proximal Level Bundle Methods for Convex Nondifferentiable Optimization, Saddle-Point Problems, and Variational Inequalities, Mathematical Programming, Vol. 69, pp. 89-109, 1995.
14. HOITOMT, D. J., LUH, P. B., and PATTIPATI, K. R., A Practical Approach to Job Shop Scheduling Problems, IEEE Transactions on Robotics and Automation, Vol. 9, pp. 1-13, 1993.