Pages that link to "Item:Q1373738"

The following pages link to A semidefinite framework for trust region subproblems with applications to large scale minimization (Q1373738):

Displaying 50 items.

• A linear-time algorithm for trust region problems (Q304248) (← links)
• Computing quasisolutions of nonlinear inverse problems via efficient minimization of trust region problems (Q318179) (← links)
• Erratum to: A trust region method for solving semidefinite programs (Q354632) (← links)
• A trust region method for solving semidefinite programs (Q354640) (← links)
• Models and algorithms for distributionally robust least squares problems (Q403637) (← links)
• The generalized trust region subproblem (Q457202) (← links)
• Strong duality for generalized trust region subproblem: S-lemma with interval bounds (Q497446) (← links)
• Local nonglobal minima for solving large-scale extended trust-region subproblems (Q513712) (← links)
• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
• A practical method for solving large-scale TRS (Q537634) (← links)
• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
• Error bounds of Lanczos approach for trust-region subproblem (Q722456) (← links)
• On the spherical quasi-convexity of quadratic functions on spherically subdual convex sets (Q831352) (← links)
• Regularization using a parameterized trust region subproblem (Q959940) (← links)
• A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
• Advances in trust region algorithms for constrained optimization (Q1294548) (← links)
• A potential reduction approach to the frequency assignment problem (Q1377670) (← links)
• On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
• A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications (Q1576348) (← links)
• SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
• A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality (Q1655381) (← links)
• An efficient algorithm for solving the generalized trust region subproblem (Q1655384) (← links)
• Quadratic programs with hollows (Q1659682) (← links)
• Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem (Q1686558) (← 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)
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
• A geometric analysis of phase retrieval (Q1785008) (← links)
• An iterative algorithm for the conic trust region subproblem (Q1791853) (← links)
• A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
• A feasible direction method for image restoration (Q1926625) (← links)
• Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints (Q1932818) (← links)
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
• Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
• An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty (Q2071422) (← 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)
• On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint (Q2174902) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method (Q2185999) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• Characterization of solution sets of convex optimization problems in Riemannian manifolds (Q2291683) (← 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)
• A modified trust region method with beale's PCG technique for optimization (Q2427396) (← links)
• The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
• Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems (Q2572610) (← links)
• A fast algorithm for globally solving Tikhonov regularized total least squares problem (Q2633538) (← links)
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
• A two-variable approach to the two-trust-region subproblem (Q2796795) (← links)