What people are saying - Write a review
We haven't found any reviews in the usual places.
Some Properties of the Variable Metric Algorithm
On Some Methods Based on Broydens Secant Approximation to
A Class of Rank1 Optimization Algorithms
20 other sections not shown
accuracy active constraints active set approach approximation barrier function basis bound Broyden coefficients Comput conjugate considered constrained problems convex function corresponding CP-D defined denote DFP-D dimensionality efficient equality constraints equation exterior-point methods Fiacco and McCormick finite Fletcher function evaluations given global solution Hessian matrix inequality initial simplex integer interior-point inverse Hessian ISTEP Kuhn-Tucker Lagrange multipliers Lagrangian function least squares lemma linear constraints linear programming linear search Lootsma loss function Math Mathematics minimum solution non-convex non-linear Nonlinear Programming number of function number of iterations objective function obtained paper parameter penalty function positive definite Powell Powell's procedure properties quadratic function quadratic programming Quasi-Newton methods rate of convergence satisfied second derivatives Section sequence simplex method solving starting point step storage strategy Table technique termination test functions test problems Theorem tion trajectory unconstrained minimization unconstrained optimization variable metric algorithm vector zero