Pages that link to "Item:Q3686437"
From MaRDI portal
The following pages link to On the global convergence of trust region algorithms for unconstrained minimization (Q3686437):
Displayed 36 items.
- Convergence properties of trust region methods for linear and convex constraints (Q922951) (← links)
- A nonmonotone trust-region method of conic model for unconstrained optimization (Q939515) (← links)
- A nonmonotone conic trust region method based on line search for solving unconstrained optimization (Q1002190) (← links)
- Computation of a trust region step (Q1198611) (← links)
- Respecifying the weighting matrix of a quadratic objective function (Q1251390) (← links)
- Inexact trust region method for large sparse systems of nonlinear equations (Q1331125) (← links)
- A trust region algorithm for minimization of locally Lipschitzian functions (Q1338134) (← links)
- A trust region method for minimization of nonsmooth functions with linear constraints (Q1356054) (← links)
- Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations (Q1379937) (← links)
- A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints. (Q1412814) (← links)
- Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
- A robust descent type algorithm for geophysical inversion through adaptive regularization (Q1614201) (← links)
- A nonmonotone adaptive trust region method and its convergence (Q1827231) (← links)
- Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
- A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization (Q1888512) (← links)
- A unified approach to global convergence of trust region methods for nonsmooth optimization (Q1890930) (← links)
- Hybrid methods for large sparse nonlinear least squares (Q1918021) (← links)
- Superlinearly convergent trust-region method without the assumption of positive-definite Hessian (Q2370038) (← links)
- Value functions and error bounds of trust region methods (Q2454979) (← links)
- A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830) (← links)
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values (Q2475129) (← links)
- A new trust region method for unconstrained optimization (Q2479356) (← links)
- A robust trust region method for nonlinear optimization with inequality constraint (Q2496002) (← links)
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148) (← links)
- A variant of trust-region methods for unconstrained optimization (Q2518723) (← links)
- An adaptive approach of conic trust-region method for unconstrained optimization problems (Q2574333) (← links)
- A Trust Region Algorithm with Memory for Equality Constrained Optimization (Q3514747) (← links)
- Conditions for convergence of trust region algorithms for nonsmooth optimization (Q3696877) (← links)
- Descent methods for composite nondifferentiable optimization problems (Q3705231) (← links)
- Second order necessary and sufficient conditions for convex composite NDO (Q3782317) (← links)
- Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations<sup>∗</sup> (Q3839446) (← links)
- Convergence of a projected gradient method with trust region for nonlinear constrained optimization† (Q4327888) (← links)
- (Q4338426) (← links)
- (Q4364313) (← links)
- Convergence analysis of the Levenberg–Marquardt method (Q5436926) (← links)
- Trust-region interior-point method for large sparse<i>l</i><sub>1</sub>optimization (Q5437524) (← links)