Advances in Nonlinear Programming

Proceedings of the 96 International Conference on Nonlinear Programming

Inbunden, Engelska, 1998

1 379 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Containing some of the most recent results in nonlinear programming (in 1998), this text includes results on trust region algorithms, interior point methods, quasi-Newton methods, conjugate gradient methods, and methods for variational problems. The work should be useful as a reference source for researchers, engineers and graduate students.

Produktinformation

Utgivningsdatum1998-05-31
Mått156 x 234 x 25 mm
Vikt723 g
FormatInbunden
SpråkEngelska
SerieApplied Optimization
Antal sidor353
Upplaga1998
FörlagKluwer Academic Publishers
ISBN9780792350538

Tillhör följande kategorier

I Key Note Lecture.- 1 The use of band matrices for second derivative approximations in trust region algorithms.- II Invited Lectures.- 2 A Primal-Dual Interior Method for Nonconvex Nonlinear Programming.- 3 Structure and Efficient Hessian Calculation.- 4 Piecewise line-search techniques for constrained minimization by quasi-Newton algorithms.- 5 Newton-Type Methods for Variational Inequalities.- 6 Computer Solution of Linear Programs: Non-Simplex Algorithms.- 7 Combining Trust Region and Line Search Techniques.- 8 SQ2P, Sequential Quadratic Constrained Quadratic Programming.- 9 An example of non-convergence of trust region algorithms.- III Contributed Papers.- 10 Combining Trust Region and Affine Scaling for Linearly Constrained Nonconvex Minimization.- 11 Some Properties of A New Conjugate Gradient Method.- 12 Using Huber Method to solve nonlinear L1-norm Problem.- 13 Robust Methods for an Inverse Heat Conduction Problem.- 14 Superlinear Convergence of a Symmetric Primal-dual Path Following Algorithm for SDP.- 15 Nonlinear Programming on Networks with Discrete-Continuous Variables.- 16 Algorithms guaranteeing iterative points within nonnegative orthant in complementarity problems.- 17 Globally Convergent Interior Path Following Methods for Nonlinear Programming and Brouwer Fixed Point Problems.- 18 A further study on a penalty function of Bertsekas.