A sequential cutting plane algorithm for solving convex NLP problems

European Journal of Operational Research

Volumn 173, Issue 2, 2006, Pages 444-464

  Still, Claus ^a   Westerlund, Tapio ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Convex programming; Cutting plane algorithms; Nonlinear programming; Sequential linear programming

Indexed keywords

NONLINEAR PROGRAMMING; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

CONVEX PROGRAMMING; CUTTING PLANE ALGORITHMS; PROGRAMMING ALGORITHMS; SEQUENTIAL LINEAR PROGRAMMING;

ALGORITHMS;

EID: 33646526952     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.02.045     Document Type: Article

References (19)

1. Bertsekas D.P. Constrained Optimization and Lagrange Multiplier Methods (1982), Academic Press, New York
2. Conn A.R., Gould N.I.M., and Toint P.L. A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM Journal on Numerical Analysis 28 (1991) 545-572
3. Czyzyk J., Mesnier M.P., and Moré J.J. The NEOS server. IEEE Journal on Computational Science and Engineering 5 (1998) 68-75
4. E.D. Dolan, The NEOS Server 4.0 Administrative Guide, Technical Memorandum ANL/MCS-TM-250, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 2001.
5. R. Fletcher, S. Leyffer, User Manual for filterSQP, Numerical Analysis Report NA/181, Department of Mathematics, University of Dundee, Dundee, 1998.
6. Gill P.E., Murray W., and Wright M.H. Practical Optimization (1981), Academic Press, London
7. Hock W., and Schittkowski K. Test examples for nonlinear programming codes. Lecture Notes in Economics and Mathematical Systems vol. 187 (1981), Springer-Verlag, Berlin
8. S. Karlsson, Optimization of a Sequential-Simulated Moving-Bed Separation Process with Mathematical Programming Methods, Ph.D. Thesis, Process Design Laboratory, Åbo Akademi University, Åbo, 2001.
9. Kelley J.E. The cutting plane method for solving convex programs. Journal of SIAM 8 4 (1960) 703-712
10. Luenberger D.G. Linear and Nonlinear Programming. second ed. (1984), Addison-Wesley Publishing Company, Reading, Massachusetts
11. B.A. Murtagh, M.A. Saunders, MINOS 5.5 User's Guide, Technical Report SOL 83-20R, Stanford University, Stanford, California, 1998.
12. Pörn R., and Westerlund T. A cutting plane method for minimizing pseudo-convex functions in the mixed integer case. Computers and Chemical Engineering 24 (2000) 2655-2665
13. Schittkowski K. More test examples for nonlinear programming codes. Lecture Notes in Economics and Mathematical Systems vol. 282 (1987), Springer-Verlag, Berlin
14. Still C., and Westerlund T. Extended cutting plane algorithm. In: Floudas C.A., and Pardalos P.M. (Eds). Encyclopedia of Optimization vol. 2 (2001), Kluwer Academic Publishers, Dordrecht 53-61
15. C. Still, T. Westerlund, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, Computational Optimization and Applications, submitted for publication.
16. R. Vanderbei, Nonlinear optimization models, Web Home Page, .
17. Westerlund T., and Pettersson F. An extended cutting plane method for solving convex MINLP problems. Computers and Chemical Engineering 19 Suppl. (1995) S131-S136
18. Westerlund T., Skrifvars H., Harjunkoski I., and Pörn R. An extended cutting plane method for a class of non-convex MINLP problems. Computers and Chemical Engineering 22 (1998) 357-365
19. T. Westerlund, K. Lundqvist, Alpha-ECP Version 5.01. An Interactive MINLP-solver Based on the Extended Cutting Plane Method, Report 01-178-A, Process Design Laboratory, Åbo Akademi University, Åbo, 2001.