Pages that link to "Item:Q304248"
From MaRDI portal
The following pages link to A linear-time algorithm for trust region problems (Q304248):
Displayed 25 items.
- A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint (Q2174902) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
- A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint (Q2244966) (← links)
- Oracle-Based Robust Optimization via Online Learning (Q3450465) (← links)
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods (Q4571045) (← links)
- Accelerated Methods for NonConvex Optimization (Q4571877) (← links)
- Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices (Q5009509) (← links)
- First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem (Q5116545) (← links)
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems (Q5210741) (← links)
- On Conic Relaxations of Generalization of the Extended Trust Region Subproblem (Q5214417) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere (Q5231687) (← links)
- Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step (Q5233102) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
- A Linear-Time Algorithm for Generalized Trust Region Subproblems (Q5853724) (← links)
- Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method (Q5863879) (← links)
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
- On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem (Q6092945) (← links)
- A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← links)
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)