Pages that link to "Item:Q5348458"

The following pages link to A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458):

Displaying 30 items.

• An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
• 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 the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
• Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem (Q2165873) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
• A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint (Q2244966) (← links)
• The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables (Q2670502) (← links)
• Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
• Globally Solving the Trust Region Subproblem Using Simple First-Order Methods (Q4571045) (← links)
• Accelerated Methods for NonConvex Optimization (Q4571877) (← links)
• A Block Lanczos Method for the Extended Trust-Region Subproblem (Q4629333) (← links)
• An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications (Q5003212) (← links)
• On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← 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)
• Online First-Order Framework for Robust Convex Optimization (Q5131545) (← 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)
• 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)
• 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)
• 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)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity (Q6136657) (← links)