Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Group

Gradient and Quasi-Newton Optimization Methods

Iterative methods for minimizing smooth functions, such as the BFGS algorithm, the Frank-Wolfe algorithm and sequential quadratic programming. An algorithm belongs here when its cited article describes an iterative method for unconstrained or constrained numerical optimization. It excludes linear programming and metaheuristic methods. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.

Browse By
Gradient and Quasi-Newton Optimization Methods
Filter Results3 entries
Sources
Broyden-Fletcher-Goldfarb-Shanno algorithm (Wikipedia)
Has Member: BFGS Algorithm, Lead section
Quote, Has Member: BFGS Algorithm, Lead section
iterative method for solving unconstrained nonlinear optimization
View the Source
Frank-Wolfe algorithm (Wikipedia)
Has Member: Frank-Wolfe Algorithm, Lead section
Quote, Has Member: Frank-Wolfe Algorithm, Lead section
iterative first-order optimization algorithm for constrained convex optimization
View the Source
Sequential quadratic programming (Wikipedia)
Has Member: Sequential quadratic programming, Lead section
Quote, Has Member: Sequential quadratic programming, Lead section
is an iterative method for constrained nonlinear optimization
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.