Pages that link to "Item:Q4229454"
From MaRDI portal
The following pages link to Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization (Q4229454):
Displaying 25 items.
- A curvilinear method based on minimal-memory BFGS updates (Q711340) (← links)
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization (Q953368) (← links)
- Improving directions of negative curvature in an efficient manner (Q1026565) (← links)
- A survey of truncated-Newton methods (Q1593812) (← links)
- Using negative curvature in solving nonlinear programs (Q1694388) (← links)
- Iterative grossone-based computation of negative curvature directions in large-scale optimization (Q2194128) (← links)
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems (Q2379688) (← links)
- Iterative computation of negative curvature directions in large scale optimization (Q2457949) (← links)
- An unconstrained optimization method using nonmonotone second order Goldstein's line search (Q2464310) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Nonconvex optimization using negative curvature within a modified linesearch (Q2482748) (← links)
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application (Q2569194) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems (Q2644350) (← links)
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation (Q2770192) (← links)
- A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks (Q4657813) (← links)
- A dwindling filter line search method for unconstrained optimization (Q5497020) (← links)
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization (Q5859003) (← links)
- On the nonmonotone line search (Q5959912) (← links)
- On the final steps of Newton and higher order methods (Q5963239) (← links)
- Adaptive nonmonotone line search method for unconstrained optimization (Q6059117) (← links)