Pages that link to "Item:Q1180757"

The following pages link to Quadratically constrained least squares and quadratic problems (Q1180757):

Displaying 38 items.

• Projected Tikhonov regularization of large-scale discrete ill-posed problems (Q368090) (← links)
• Discrete ill-posed least-squares problems with a solution norm constraint (Q414659) (← links)
• A relaxed projection method for split variational inequalities (Q493247) (← links)
• An iterative algorithm for large size least-squares constrained regularization problems (Q555485) (← links)
• An iterative Lagrange method for the regularization of discrete ill-posed inverse problems (Q614354) (← links)
• Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint (Q693140) (← links)
• Robust inversion, dimensionality reduction, and randomized sampling (Q715245) (← links)
• Error bounds of Lanczos approach for trust-region subproblem (Q722456) (← links)
• Some projection methods with the BB step sizes for variational inequalities (Q765311) (← links)
• Application of Gauss quadrature rule in finding bounds for solution of linear systems of equations (Q849785) (← links)
• Sensor network localization with imprecise distances (Q875138) (← links)
• Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. II. singular weights (Q946780) (← links)
• Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
• Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint (Q1041439) (← links)
• Iterative methods to compute weighted normal pseudosolutions with positive definite weights (Q1280950) (← links)
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems (Q1316068) (← links)
• Estimates in quadratic formulas (Q1344109) (← links)
• Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
• Solving large-scale constrained least-squares problems. (Q1406109) (← links)
• The block Lanczos algorithm for linear ill-posed problems (Q1675423) (← links)
• New zero-finders for trust-region computations (Q1678583) (← links)
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
• Variational analysis of an extended eigenvalue problem (Q1893098) (← links)
• Hidden convexity in some nonconvex quadratically constrained quadratic programming (Q1919813) (← links)
• Minimization of functionals on the solution of a large-scale discrete ill-posed problem (Q1944012) (← links)
• Convexity of quadratic transformations and its use in control and optimization (Q1969525) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Self-adaptive projection-based prediction-correction method for constrained variational inequalities (Q2266827) (← links)
• Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration (Q2318302) (← links)
• An iterative Lavrentiev regularization method (Q2433872) (← links)
• A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints (Q2450861) (← links)
• Expansion of weighted pseudoinverse matrices with positive definite weights into matrix power products. iterative methods (Q2458108) (← links)
• Series expansion of weighted pseudoinverse matrices and iterative methods for calculating weighted pseudoinverse matrices and weighted normal pseudosolutions (Q2501327) (← links)
• Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems (Q2572610) (← links)
• Iterative methods with different rates of convergence for calculating weighted pseudoinverse matrices and weighted normal pseudosolutions with positive definite weights (Q2574237) (← links)
• A Nested Lanczos Method for the Trust-Region Subproblem (Q3174764) (← links)
• Optimization landscape in the simplest constrained random least-square problem (Q5048890) (← links)
• Solving trust region subproblems using Riemannian optimization (Q6109916) (← links)