A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem

From MaRDI portal
Publication:2706346

DOI10.1137/S105262349928887XzbMath0994.65067OpenAlexW2058885431MaRDI QIDQ2706346

Marielba Rojas, Danny C. Sorensen, Sandra Augusta Santos

Publication date: 19 March 2001

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s105262349928887x



Related Items

Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem, A linear-time algorithm for trust region problems, A Nested Lanczos Method for the Trust-Region Subproblem, 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, Projected Tikhonov regularization of large-scale discrete ill-posed problems, Canonical Dual Approach for Minimizing a Nonconvex Quadratic Function over a Sphere, A feasible direction method for image restoration, An iterative Lagrange method for the regularization of discrete ill-posed inverse problems, 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, On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint, A mathematical biography of Danny C. Sorensen, Minimization of functionals on the solution of a large-scale discrete ill-posed problem, Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations, On the Generalized Lanczos Trust-Region Method, Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem, A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems, Behavior of DCA sequences for solving the trust-region subproblem, 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, A matrix-free line-search algorithm for nonconvex optimization, Local nonglobal minima for solving large-scale extended trust-region subproblems, On solving L-SR1 trust-region subproblems, Approximate Dynamic Programming based on High Dimensional Model Representation, Regularization using a parameterized trust region subproblem, An automatic and parameter-free information-based method for sparse representation in wavelet bases, A practical method for solving large-scale TRS, Solving trust-region subproblem augmented with linear inequality constraints, Trust-region interior-point method for large sparsel1optimization, Error bounds of Lanczos approach for trust-region subproblem, New line search methods for unconstrained optimization, Error estimates for iterative algorithms for minimizing regularized quadratic subproblems, Distance-based discriminant analysis method and its applications, Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization, Subspace Acceleration for Large-Scale Parameter-Dependent Hermitian Eigenproblems, Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization, Matrix-free algorithm for the large-scale constrained trust-region subproblem, On the ill-posedness of the trust region subproblem, BFGS trust-region method for symmetric nonlinear equations, An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty, A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint, Tilt stability for quadratic programs with one or two quadratic inequality constraints, Advances in trust region algorithms for constrained optimization, A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem, Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems, 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 Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization, \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm


Uses Software