A new matrix-free algorithm for the large-scale trust-region subproblem
From MaRDI portal
Recommendations
- Matrix-free algorithm for the large-scale constrained trust-region subproblem
- Solving the quadratic trust-region subproblem in a low-memory BFGS framework
- A practical method for solving large-scale TRS
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
Cited in
(63)- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- Matrix-free algorithm for the large-scale constrained trust-region subproblem
- A practical method for solving large-scale TRS
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
- The generalized trust region subproblem
- An automatic and parameter-free information-based method for sparse representation in wavelet bases
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- A mathematical biography of Danny C. Sorensen
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
- A matrix-free trust-region Newton algorithm for convex-constrained optimization
- A Krylov subspace method for large-scale second-order cone linear complementarity problem
- BFGS trust-region method for symmetric nonlinear equations
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations
- A new algorithm for solving trust-region subproblems with quadratic model
- Advances in trust region algorithms for constrained optimization
- Error bounds of Lanczos approach for trust-region subproblem
- The use of quadratic regularization with a cubic descent condition for unconstrained optimization
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- Solving the quadratic trust-region subproblem in a low-memory BFGS framework
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
- A linear-time algorithm for trust region problems
- Distance-based discriminant analysis method and its applications
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Behavior of DCA sequences for solving the trust-region subproblem
- New line search methods for unconstrained optimization
- Accelerating the LSTRS algorithm
- An iterative Lagrange method for the regularization of discrete ill-posed inverse problems
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- An iterative algorithm for the conic trust region subproblem
- On the generalized Lanczos trust-region method
- Regularization using a parameterized trust region subproblem
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- A matrix-free line-search algorithm for nonconvex optimization
- On the ill-posedness of the trust region subproblem
- Homogeneous second-order descent framework: a fast alternative to Newton-type methods
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem
- Tilt stability for quadratic programs with one or two quadratic inequality constraints
- Canonical dual approach for minimizing a nonconvex quadratic function over a sphere
- Solving the cubic regularization model by a nested restarting Lanczos method
- A feasible direction method for image restoration
- Trust-region interior-point method for large sparsel1optimization
- On solving L-SR1 trust-region subproblems
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- Projected Tikhonov regularization of large-scale discrete ill-posed problems
- On convergence of the generalized Lanczos trust-region method for trust-region subproblems
- Solving trust-region subproblem augmented with linear inequality constraints
- A Nested Lanczos Method for the Trust-Region Subproblem
- Algorithm 873
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem
- First-order perturbation theory of trust-region subproblem
- Approximate dynamic programming based on high dimensional model representation
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- Globally solving the trust region subproblem using simple first-order methods
- Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
This page was built for publication: A new matrix-free algorithm for the large-scale trust-region subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706346)
