Pages that link to "Item:Q5667962"

The following pages link to Quadratic Termination Properties of Minimization Algorithms I. Statement and Discussion of Results (Q5667962):

Displaying 12 items.

• A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
• Degenerate values for Broyden methods (Q1135088) (← links)
• A bound to the condition number of canonical rank-two corrections and applications to the variable metric method (Q1222501) (← links)
• A regularized limited memory BFGS method for nonconvex unconstrained minimization (Q2248965) (← links)
• The convergence of variable metric matrices in unconstrained optimization (Q3314451) (← links)
• Equivalence of some quadratic programming algorithms (Q3343781) (← links)
• Evaluating computational efficiency: A stochastic approach (Q3951477) (← links)
• An alternate implementation of Goldfarb's minimization algorithm (Q4068458) (← links)
• Matrix factorizations in optimization of nonlinear functions subject to linear constraints (Q4152044) (← links)
• Generating conjugate directions without line searches using factorized variable metric updating formulas (Q4177352) (← links)
• Quadratic termination properties of Davidon's new variable metric algorithm (Q4184640) (← links)
• Local and<i>Q</i>-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡ (Q4327895) (← links)