Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
From MaRDI portal
Publication:3124040
DOI10.1137/S1052623494274374zbMath0878.65044OpenAlexW2080641403MaRDI QIDQ3124040
Publication date: 5 January 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494274374
algorithmeigenvectorspherical constraintimplicitly restarted Lanczos methodparameterized eigenvalue problemlarge scale quadratic functionlarge scale trust-region subproblem
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)
Related Items (37)
On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ A linear-time algorithm for trust region problems ⋮ A Nested Lanczos Method for the Trust-Region Subproblem ⋮ A fast algorithm for globally solving Tikhonov regularized total least squares problem ⋮ Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem ⋮ Globally Solving the Trust Region Subproblem Using Simple First-Order Methods ⋮ Canonical Dual Approach for Minimizing a Nonconvex Quadratic Function over a Sphere ⋮ Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ Convex optimization approach to a single quadratically constrained quadratic minimization problem ⋮ A mathematical biography of Danny C. Sorensen ⋮ A modified trust region method with beale's PCG technique for optimization ⋮ On the Generalized Lanczos Trust-Region Method ⋮ Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem ⋮ Newton-type methods for non-convex optimization under inexact Hessian information ⋮ Separable spherical constraints and the decrease of a quadratic function in the gradient projection step ⋮ A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems ⋮ The generalized trust region subproblem ⋮ Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint ⋮ trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem ⋮ The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints ⋮ Regularization using a parameterized trust region subproblem ⋮ A practical method for solving large-scale TRS ⋮ Global convergence of SSM for minimizing a quadratic over a sphere ⋮ The trust region subproblem and semidefinite programming* ⋮ Topology trivialization and large deviations for the minimum in the simplest random optimization ⋮ Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ Distributed Gauss-Newton optimization method for history matching problems with multiple best matches ⋮ Error bounds of Lanczos approach for trust-region subproblem ⋮ A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid ⋮ A survey on variational characterizations for nonlinear eigenvalue problems ⋮ Matrix-free algorithm for the large-scale constrained trust-region subproblem ⋮ Advances in trust region algorithms for constrained optimization ⋮ The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem ⋮ Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method ⋮ Implicitly restarted projection algorithm for solving optimization problems
This page was built for publication: Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
