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):
Displaying 36 items.
- The convergence of subspace trust region methods (Q2389569) (← links)
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← 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 new trust region method with adaptive radius for unconstrained optimization (Q2885488) (← links)
- A trust region subspace method for large-scale unconstrained optimization (Q2920366) (← links)
- COMBINATION ADAPTIVE TRUST REGION METHOD BY NON-MONOTONE STRATEGY FOR UNCONSTRAINED NONLINEAR PROGRAMMING (Q3103654) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- A Trust Region Algorithm with Memory for Equality Constrained Optimization (Q3514747) (← links)
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties (Q3692734) (← 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)
- A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points (Q4620423) (← links)
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
- AN IMPROVED ADAPTIVE TRUST-REGION METHOD FOR UNCONSTRAINED OPTIMIZATION (Q5011194) (← links)
- An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization (Q5028601) (← links)
- Second-Order Guarantees of Distributed Gradient Algorithms (Q5131964) (← links)
- On the convergence of a wide range of trust region methods for unconstrained optimization (Q5189139) (← links)
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← 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)
- Tikhonov regularization for a general nonlinear constrained optimization problem (Q6123106) (← links)
- Consistent approximations in composite optimization (Q6165588) (← links)
- Trust-region based return mapping algorithm for implicit integration of elastic-plastic constitutive models (Q6557449) (← links)
- A Levenberg-Marquardt method for nonsmooth regularized least squares (Q6590132) (← links)