Pages that link to "Item:Q2535817"

The following pages link to Unified approach to quadratically convergent algorithms for function minimization (Q2535817):

Displaying 50 items.

• An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods (Q511970) (← links)
• Improved Hessian approximation with modified secant equations for symmetric rank-one method (Q629505) (← links)
• On exact linesearch quasi-Newton methods for minimizing a quadratic function (Q683343) (← links)
• On the Huang class of variable metric methods (Q700695) (← links)
• A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer (Q809551) (← links)
• Two new conjugate gradient methods based on modified secant equations (Q972741) (← links)
• One class of dual matrix methods (Q1135900) (← links)
• Generalized conjugate directions for unconstrained function minimization (Q1173013) (← links)
• Conditions for variable-metric algorithms to be conjugate-gradient algorithms (Q1173014) (← links)
• A rational gradient model for minimization (Q1196831) (← links)
• A class of quadratically convergent algorithms for constrained function minimization (Q1211414) (← links)
• Variable metric methods in Hilbert space with applications to control problems (Q1218146) (← links)
• Numerical experiments on DFP-method, a powerful function minimization technique (Q1221477) (← links)
• A variable metric-method for function minimization derived from invariancy to nonlinear scaling (Q1221696) (← links)
• Direct-prediction quasi-Newton methods in Hilbert space with applications to control problems (Q1225437) (← links)
• Some investigations about a unified approach to quadratically convergent algorithms for function minimization (Q1225915) (← links)
• Direct prediction methods in Hilbert space with applications to control problems (Q1229830) (← links)
• Approximation methods for the unconstrained optimization (Q1234630) (← links)
• Unified approach to unconstrained minimization via basic matrix factorizations (Q1242195) (← links)
• Suboptimal explicit receding horizon control via approximate multiparametric quadratic pro\-gramming (Q1411488) (← links)
• Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
• A class of one parameter conjugate gradient methods (Q1664259) (← links)
• Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
• Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming (Q1790671) (← links)
• Least-squares solution of \(F=PG\) over positive semidefinite symmetric \(P\) (Q1923195) (← links)
• Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function (Q2044499) (← links)
• A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
• A double parameter self-scaling memoryless BFGS method for unconstrained optimization (Q2190850) (← links)
• On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems (Q2340523) (← links)
• Local and superlinear convergence of quasi-Newton methods based on modified secant conditions (Q2372957) (← links)
• Numerical experiments on quadratically convergent algorithms for function minimization (Q2536596) (← links)
• On variable-metric algorithms (Q2541844) (← links)
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions (Q2549166) (← links)
• Unconstrained approach to the extremization of constrained functions (Q2553077) (← links)
• Quadratically convergent algorithms and one-dimensional search schemes (Q2553146) (← links)
• Stability of Huang's update for the conjugate gradient method (Q2554542) (← links)
• On the uniqueness of search directions in variable metric algorithms (Q2555452) (← links)
• New approach to comparison of search methods used in nonlinear programming problems (Q2560771) (← links)
• Method of dual matrices for function minimization (Q2560773) (← links)
• Numerical experiments on dual matrix algorithms for function minimization (Q2560774) (← links)
• A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm (Q3311596) (← links)
• Some notes on the quasi-Newton methods (Q3664331) (← links)
• Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization (Q4060281) (← links)
• (Q4091721) (← links)
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation (Q4158413) (← links)
• Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization (Q4162403) (← links)
• Nonlinear hybrid procedures and fixed point iterations (Q4210729) (← links)
• Eigenvalues and switching algorithms for Quasi-Newton updates (Q4375436) (← links)
• Optimization of large-scale complex systems (Q4723614) (← links)
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods (Q4768565) (← links)