From: spellucci@mathematik.tu-darmstadt.de (Peter Spellucci)
Subject: Re: SQP
Date: 6 Mar 2000 15:39:22 GMT
Newsgroups: sci.math.num-analysis
Summary: [missing]

In article <89pees$2p69s$1@fu-berlin.de>,
 "Sotirios Pappas" <Sotto@neraida.ruhr.de> writes:
|> Hello,
|> 
|> I am looking for books and links about OPTIMIZATION
|> and (F)SQP methode
http://plato.la.asu.edu/guide.html
has it all.
FSQP is desribed only in Tits code description and the original articels
in SIAM J. Numer. Anal. etc 

Lawrence, Craig T.; Tits, Andre L.
Feasible sequential quadratic programming for 
finely discretized problems from SIP. (English)
[CA] Reemtsen, Rembert (ed.) et al., 
Semi-infinite programming. Workshop, Cottbus, Germany, September 1996. 
Boston: Kluwer Academic Publishers. Nonconvex Optim. Appl.
25, 159-193 (1998). [ISBN 0-7923-5054-5]


Bonnans, J.Frederic; Panier, Eliane R.; Tits, Andre L.; Zhou, Jian L.
Avoiding the Maratos effect by means of a nonmonotone line search. 
II: Inequality constrained problems --- feasible iterates. (English)
[J] SIAM J. Numer. Anal. 29, No.4, 1187-1202 (1992).

 
Panier, Eliane R.; Tits, Andre L.
A superlinearly convergent feasible method for the solution of 
inequality constrained optimization problems. (English)
[J] SIAM J. Control Optimization 25, 934-950 (1987).

hope this helps
peter