Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
From MaRDI portal
Recommendations
Cited in
(53)- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- Advances in trust region algorithms for constrained optimization
- Solving large-scale constrained least-squares problems.
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- Distributed Gauss-Newton optimization method for history matching problems with multiple best matches
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- Topology trivialization and large deviations for the minimum in the simplest random optimization
- A survey on variational characterizations for nonlinear eigenvalue problems
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- An active-set algorithm for norm constrained quadratic problems
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method
- Newton-type methods for non-convex optimization under inexact Hessian information
- A modified trust region method with beale's PCG technique for optimization
- A fast algorithm for globally solving Tikhonov regularized total least squares problem
- Minimizing a quadratic over a sphere
- Canonical dual approach for minimizing a nonconvex quadratic function over a sphere
- Solving the trust-region subproblem by a generalized eigenvalue problem
- 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 subspace method for large-scale eigenvalue optimization
- A Nested Lanczos Method for the Trust-Region Subproblem
- Minimization of a quadratic function over a sphere
- Nonconvex minimization of a quadratic function over a sphere
- Algorithm 873
- A mathematical biography of Danny C. Sorensen
- scientific article; zbMATH DE number 1182579 (Why is no real title available?)
- Implicitly restarted projection algorithm for solving optimization problems
- Globally solving the trust region subproblem using simple first-order methods
- The generalized trust region subproblem
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- Global convergence of SSM for minimizing a quadratic over a sphere
- The trust region subproblem and semidefinite programming*
- Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- A second-order cone based approach for solving the trust-region subproblem and its variants
- On the generalized Lanczos trust-region method
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- A practical method for solving large-scale TRS
- Computing the Local-Nonglobal Minimizer of a Large Scale Trust-Region Subproblem
- Matrix-free algorithm for the large-scale constrained trust-region subproblem
- 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
- The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- A DCA-Newton method for quartic minimization over the sphere
- Convex optimization approach to a single quadratically constrained quadratic minimization problem
- On convergence of the generalized Lanczos trust-region method for trust-region subproblems
- On convergence of the block Lanczos method for the CDT subproblem
- Why study spherical convexity of non-homogeneous quadratics and what makes it surprising?
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Error bounds of Lanczos approach for trust-region subproblem
- Regularization using a parameterized trust region subproblem
This page was built for publication: Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3124040)
