A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds

A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds

by Robert Michael Lewis

Part of ICASE report -- no. 98-31.

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free

Discuss A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds with other readers

Join or start a book club for A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds?

Sign up free on Readfeed, then browse public clubs or start your own club with A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.