Pages that link to "Item:Q457202"
From MaRDI portal
The following pages link to The generalized trust region subproblem (Q457202):
Displaying 30 items.
- S-lemma with equality and its applications (Q263215) (← links)
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds (Q497446) (← links)
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
- An efficient algorithm for solving the generalized trust region subproblem (Q1655384) (← links)
- Quadratic programs with hollows (Q1659682) (← links)
- A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm (Q2114814) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem (Q2165873) (← 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)
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere (Q2301183) (← links)
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint (Q2322558) (← links)
- The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
- A fast algorithm for globally solving Tikhonov regularized total least squares problem (Q2633538) (← links)
- Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications (Q2689864) (← links)
- Non-quadratic extension of homogeneous S-lemma and its applications in optimization (Q2698599) (← links)
- Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming (Q2817836) (← links)
- An SDP approach for quadratic fractional problems with a two-sided quadratic constraint (Q2829557) (← links)
- On the quadratic fractional optimization with a strictly convex quadratic constraint (Q2948116) (← links)
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem (Q2967610) (← links)
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
