Pages that link to "Item:Q1686552"

The following pages link to A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552):

Displaying 10 items.

• An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← 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)
• Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
• A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint (Q2244966) (← links)
• Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
• Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
• A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← links)
• A Convex Approximation for a PDE Constrained Fractional Optimization Problem with an Application to Photonic Crystal Design (Q6188656) (← links)