Pages that link to "Item:Q2503148"

The following pages link to A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148):

Displaying 30 items.

• Limited-memory BFGS systems with diagonal updates (Q417600) (← links)
• A Riemannian subspace limited-memory SR1 trust region method (Q518140) (← links)
• A hybrid ODE-based method for unconstrained optimization problems (Q694546) (← links)
• A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization (Q743777) (← links)
• Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization (Q746819) (← links)
• Subspace methods for large scale nonlinear equations and nonlinear least squares (Q833458) (← links)
• Subspace choices for the Celis-Dennis-Tapia problem (Q1701260) (← links)
• Subspace trust-region algorithm with conic model for unconstrained optimization (Q1953148) (← links)
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
• A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors (Q2302750) (← links)
• A subspace SQP method for equality constrained optimization (Q2322557) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
• The convergence of subspace trust region methods (Q2389569) (← links)
• On subspace properties of the quadratically constrained quadratic program (Q2411152) (← links)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
• A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
• A variant of trust-region methods for unconstrained optimization (Q2518723) (← links)
• A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization (Q2660095) (← links)
• A two-dimensional subspace trust-region algorithm with a new conic model (Q2858623) (← links)
• A trust region subspace method for large-scale unconstrained optimization (Q2920366) (← links)
• (Q3489800) (← links)
• A Subspace Minimization Method for the Trust-Region Step (Q3586143) (← links)
• A Block Lanczos Method for the Extended Trust-Region Subproblem (Q4629333) (← links)
• A trust region method with project step for bound constrained optimization without compact condition (Q5031242) (← links)
• On the convergence of a wide range of trust region methods for unconstrained optimization (Q5189139) (← links)
• A Riemannian subspace BFGS trust region method (Q6081602) (← links)
• A local MM subspace method for solving constrained variational problems in image recovery (Q6162148) (← links)