• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Conjugate Gradient Algorithms in Nonconvex Optimization

Conjugate Gradient Algorithms in Nonconvex Optimization

Paperback

Series: Nonconvex Optimization and Its Applications, Book 89

Business GeneralTechnology & EngineeringGeneral Mathematics

ISBN10: 3642099254
ISBN13: 9783642099250
Publisher: Springer Nature
Published: Nov 20 2010
Pages: 478
Weight: 1.54
Height: 1.01 Width: 6.14 Depth: 9.21
Language: English
Conjugate Direction Methods for Quadratic Problems.- Conjugate Gradient Methods for Nonconvex Problems.- Memoryless Quasi-Newton Methods.- Preconditioned Conjugate Gradient Algorithms.- Limited Memory Quasi-Newton Algorithms.- The Method of Shortest Residuals and Nondifferentiable Optimization.- The Method of Shortest Residuals for Differentiable Problems.- The Preconditioned Shortest Residuals Algorithm.- Optimization on a Polyhedron.- Conjugate Gradient Algorithms for Problems with Box Constraints.- Preconditioned Conjugate Gradient Algorithms for Problems with Box Constraints.- Preconditioned Conjugate Gradient Based Reduced-Hessian Methods.

Also in

General Mathematics