zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
An SQP algorithm for extended linear-quadratic problems in stochastic programming. (English) Zbl 0835.90058
Summary: Extended Linear-Quadratic Programming (ELQP) problems were introduced by Rockafellar and Wets for various models in stochastic programming and multistage optimization. Several numerical methods with linear convergence rates have been developed for solving fully quadratic ELQP problems, where the primal and dual coefficient matrices are positive definite. We present a two-stage sequential quadratic programming (SQP) method for solving ELQP problems arising in stochastic programming. The first stage algorithm realizes global convergence and the second stage algorithm realizes superlinear local convergence under a condition called B-regularity. B-regularity is milder than the fully quadratic condition; the primal coefficient matrix need not be positive definite. Numerical tests are given to demonstrate the efficiency of the algorithm. Solution properties of the ELQP problem under B-regularity are also discussed.
MSC:
90C15Stochastic programming
90C20Quadratic programming
References:
[1]J.R. Birge and R.J-B. Wets, Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse, Math. Prog. Study 27 (1986) 54–102.
[2]X. Chen, L. Qi and R.S. Womersley, Newton’s method for quadratic stochastic programs with recourse, J. Comp. Appl. Math. 60, to appear.
[3]X. Chen and R.S. Womersley, A parallel inexact Newton method for stochastic programs with recourse, Ann. Oper. Res., to appear.
[4]F.H. Clarke,Optimization and Nonsmooth Analysis (Wiley, New York, 1983).
[5]R. Fletcher,Practical Methods of Optimization, 2nd ed. (Wiley, 1987).
[6]A. Genz and Z. Lin, Fast Givens goes slow in MATLAB, ACM Signum Newsletter 26/2 (April 1991) 11–16.
[7]P. Kall, A. Ruszczyński and K. Frauendorfer, Approximation techniques in stochastic programming, in:Numerical Techniques for Stochastic Programming, eds. Y. Ermoliev and R.J-B. Wets (Springer, Berlin, 1988) pp. 33–64.
[8]A. King, An implementation of the Lagrangian finite generation method, in:Numerical Techniques for Stochastic Programming, eds. Y. Ermoliev and R.J-B. Wets (Springer, Berlin, 1988) pp. 295–312.
[9]J.M. Mulvey and A. Ruszczyński, A new scenario decomposition for large-scale stochastic optimization, Technical Report SOR-91-19, Princeton University, Princeton, NJ, USA (revised 1992).
[10]J.S. Pang, S.P. Han and N. Rangaraj, Minimization of locally Lipschitzian functions, SIAM J. Optim. 1 (1991) 57–82. · Zbl 0752.90070 · doi:10.1137/0801006
[11]J.S. Pang and L. Qi, Nonsmooth equations: Motivations and algorithms, SIAM J. Optim. 3 (1993) 443–465. · Zbl 0784.90082 · doi:10.1137/0803021
[12]J.S. Pang and L. Qi, A globally convergent Newton method for convexSC 1 minimization problems, J. Optim. Theory Appl., to appear.
[13]L. Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 (1993) 227–244. · Zbl 0776.65037 · doi:10.1287/moor.18.1.227
[14]L. Qi, Superlinearly convergent approximate Newton methods forLC 1 optimization problems, Math. Progr. 64 (1994) 277–294. · Zbl 0820.90102 · doi:10.1007/BF01582577
[15]R.T. Rockafellar, Linear-quadratic programming and optimal control, SIAM J. Contr. Optim. 25 (1987) 781–814. · Zbl 0617.49010 · doi:10.1137/0325045
[16]R.T. Rockafellar, Computational schemes for solving large-scale problems in extended linear-quadratic programming, Math. Progr. 48 (1990) 447–474. · Zbl 0735.90050 · doi:10.1007/BF01582268
[17]R.T. Rockafellar, Large-scale extended linear-quadratic programming and multistage optimization, in:Proc. 5th Mexico-US Workshop on Numerical Analysis, eds. S. Gomez, J.P. Hennart and R. Tapia (SIAM, Philadelphia, 1990).
[18]R.T. Rockafellar and R.J-B. Wets, A dual solution procedure for quadratic stochastic programs with simple recourse, in:Numerical Methods, Lecture Notes in Mathematics 1005, ed. A. Reinoza (Springer, Berlin, 1983) pp. 252–265.
[19]R.T. Rockafellar and R.J-B. Wets, A Lagrangian finite-generation technique for solving linear-quadratic problems in stochastic programming, Math. Prog. Study 28 (1986) 63–93.
[20]R.T. Rockafellar and R.J-B. Wets, Linear-quadratic problems with stochastic penalties: the finite generation algorithm, in:Stochastic Optimization, Lecture Notes in Control and Information Sciences 81, eds. V.I. Arkin, A. Shiraev and R.J-B. Wets (Springer, Berlin, 1987) pp. 545–560.
[21]R.T. Rockafellar and R.J-B. Wets, Generalized linear-quadratic problems of deterministic and stochastic optimal control in discrete time, SIAM J. Contr. Optim. 28 (1990) 810–822. · Zbl 0714.49036 · doi:10.1137/0328046
[22]A. Ruszczyński, A regularized decomposition method for minimizing a sum of polyhedral functions, Math. Progr. 35 (1986) 309–333. · Zbl 0599.90103 · doi:10.1007/BF01580883
[23]R.J-B. Wets, Stochastic programming: Solution techniques and approximation schemes, in:Mathematical Programming: The State of the Art – Bonn 1982, eds. A. Bachem, M. Grötschel and B. Kort (Springer, Berlin, 1983) pp. 566–603.
[24]R.J-B. Wets, Stochastic programming, in:Handbook in Operations Research and Management Science, Vol. 1:Optimization, eds. G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (North-Holland, Amsterdam, 1989) pp. 573–630.
[25]C. Zhu and R.T. Rockafellar, Primal-dual projected gradient algorithms for extended linear-quadratic programming, SIAM J. Optim. 3 (1993) 751–783. · Zbl 0788.65069 · doi:10.1137/0803039