A variant of the Topkis-Veinott method for solving inequality constrained optimization problems

Applied Mathematics and Optimization

Volumn 41, Issue 3, 2000, Pages 309-330

  Birge, J R ^a   Qi, L ^b   Wei, Z ^b  

^a Northwestern University   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Constrained optimization; Feasibility; Global convergence; Stochastic programming; Unit step

Indexed keywords

EID: 0040788843     PISSN: 00954616     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002459911015     Document Type: Article

References (38)

1. Bazaraa MS, Shetty CM (1979) Nonlinear Programming - Theory and Algorithms. Wiley, New York
2. Birge JR, Qi L (1995) Subdifferentials in approximation for stochastic programming. SIAM Journal on Optimization 5:436-453
3. Birge JR, Qi L (1995) Continuous approximation schemes for stochastic programs. Annals of Operations Research 56:251-285
4. Birge JR, Wets RJB (1986) Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse. Mathematical Programming Study 27:54-102
5. Burke JV, Han SP (1989) A robust sequential quadratic programming method. Mathematical Programming 43:277-303
6. Chen X, Qi L, Womersley RS (1995) Newton's method for quadratic stochastic programs with recourse. Journal of Computational and Applied Mathematics 60:29-46
7. Chen X, Womersley RS (1996) A parallel inexact Newton method for stochastic programs with recourse. Annals of Operations Research 64:113-141
8. Clarke FH (1983) Optimization and Nonsmooth Analysis. Wiley, New York
9. Daya MB, Shetty CM (1990) Polynomial barrier function algorithms for convex quadratic programming. Arabian Journal for Science and Engineering 15:657-670
10. Fukushima M (1986) A successive quadratic programming algorithm with global and superlinear convergence properties. Mathematical Programming 35:253-264
11. Gill PE, Hammarling SJ, Murray W, Saunders MA, Wright MH (1986) User's guide for LSSOL (version 1.0): a Fortran package for constrained least-squares and convex quadratic programming. Report SOL 86-1, Department of Operations Research, Standford University
12. 3L) primal interior point algorithm for convex quadratic programming. Mathematical Programming 49:325-340
13. Han SP (1977) A globally convergent method for nonlinear programming. Journal of Optimization Theory and Applications 22:297-309
14. Herskovits J (1986) A two-stage feasible directions algorithm for nonlinear constrained optimization. Mathematical Programming 36:19-38
15. Hertog DD, Roos C, Terlaky T (1991) A polynomial method of weighted centers for convex quadratic programming. Journal of Information & Optimization Sciences 12:187-205
16. Kall P, Wallace SW (1994) Stochastic Programming. Wiley, New York
17. Kiwiel KC (1989) A dual method for solving certain positive semi-definite quadratic programming problems. SIAM Journal on Scientific and Statistical Computing 10:175-186
18. Mayne DQ, Polak E (1982) A superlinearly convergent algorithm for constrained optimization problems. Mathematical Programming Study: 16:45-61
19. Migdalas A (1994) A regularization of the Frank-Wolf method and unification of certain nonlinear programming methods. Mathematical Programming 65:331-345
20. Monteiro RDC, Adler I (1989) Interior path following primal-dual algorithms, part II: convex quadratic programming. Mathematical Programming 44:43-66
21. Monteiro RDC, Adler I, Resende MGC (1990) A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Mathematics of Operations Research 15:191-214
22. Nye WT, Tits AL (1986) An application-oriented, optimization-based methodology for interactive design of engineering systems. International Journal of Control 43:1693-1721
23. Ortega JM, Rheinboldt WC (1970) Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York
24. Panier ER, Tits AL (1987) A superlinearly convergent feasible method for the solution of inequality constrained optimization problems. SIAM Journal on Control and Optimization 4:934-950
25. Panier ER, Tits AL (1991) Avoiding theMaratos effect by means of a nonmonotone line search I: general constrained problems. SIAM Journal on Numerical Analysis 4:1183-1195
26. Panier ER, Tits AL (1993) On combining feasibility, descent and superlinear convergence in inequality constrained optimization. Mathematical Programming 59:261-276
27. Panier ER, Tits AL, Herskovits JN (1988) A QP-free globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization. SIAM Journal on Control and Optimization 4:788-811
28. Qi L (1993) Convergence analysis of some algorithms for solving nonsmooth equations. Mathematics of Operations Research 18:227-244
29. 1 optimization problems. Mathematical Programming 64:277-294
30. Qi L, Wei Z (1997) Constant positive linear independence, KKT points and convergence of feasible SQP methods. Report AMR 97/4, Department of Applied Mathematics, University of New South Wales, Sydney
31. Rockafellar RT, Wets RJB (1986) A Lagrangian finite-generation techniques for solving linear-quadratic problems in stochastic programming. Mathematical Programming Study 28:63-93
32. Rockafellar RT, Wets RJB (1987) Linear-quadratic problems with stochastic penalties: the finite generation algorithm, in: Arkin VI, Shiraev A, Wets RJB, eds, Stochastic Optimization. Lecture Notes in Control and Information Sciences 81. Springer-Verlag, Berlin, pp 55-69
33. Robinson SM (1972) A quadratically convergent algorithm for general nonlinear-programming algorithms. Mathematical Programming 3:145-156
34. Robinson SM (1982) Generalized equations and their solutions, part II: applications to nonlinear programming. Mathematical Programming Study 19:200-221
35. Topkis DM, Veinott AF (1967) On the convergence of some feasible direction algorithms for nonlinear programming. Journal on SIAM Control 5:268-279
36. Wang J (1991) Approximate nonlinear programming algorithms for solving stochastic programs with recourse. Annals of Operations Research 30:371-384
37. Wets RJB (1983) Stochastic programming: solution techniques and approximation schemes, in: Bachem A, Grötschel M, Körte B, eds, Mathematical Programming, The State of the Art - Bonn 1982. Springer-Verlag, Berlin, pp 566-603
38. Ye Y, Tse E (1989) An extension of Karmarkar's projective algorithm for convex quadratic programming. Mathematical Programming 44:157-179