Pages that link to "Item:Q4571045"
From MaRDI portal
The following pages link to Globally Solving the Trust Region Subproblem Using Simple First-Order Methods (Q4571045):
Displayed 12 items.
- Tilt stability for quadratic programs with one or two quadratic inequality constraints (Q778159) (← links)
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint (Q2104089) (← links)
- An efficient algorithm for the extended trust-region subproblem with two linear constraints (Q2119320) (← links)
- An active-set algorithm for norm constrained quadratic problems (Q2133422) (← links)
- On the branch and bound algorithm for the extended trust-region subproblem (Q2141723) (← links)
- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem (Q2165873) (← links)
- First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems (Q5210741) (← links)
- Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step (Q5233102) (← links)
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
- Solving trust region subproblems using Riemannian optimization (Q6109916) (← links)
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)