Solving the Trust-Region Subproblem using the Lanczos Method
From MaRDI portal
Publication:4702297
DOI10.1137/S1052623497322735zbMath1047.90510DBLPjournals/siamjo/GouldLRT99OpenAlexW2063690908WikidataQ58185876 ScholiaQ58185876MaRDI QIDQ4702297
Nicholas I. M. Gould, Stefano Lucidi, Massimo Roma, Phillipe L. Toint
Publication date: 24 November 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497322735
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10)
Related Items (only showing first 100 items - show all)
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization ⋮ On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem ⋮ Solving trust region subproblems using Riemannian optimization ⋮ Iterative optimal solutions of linear matrix equations for hyperspectral and multispectral image fusing ⋮ Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem ⋮ Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ Faster Riemannian Newton-type optimization by subsampling and cubic regularization ⋮ A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints ⋮ A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization ⋮ Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem ⋮ A new nonmonotone adaptive trust region algorithm. ⋮ An inertia-free filter line-search algorithm for large-scale nonlinear programming ⋮ An active-set algorithm for norm constrained quadratic problems ⋮ A linear-time algorithm for trust region problems ⋮ A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter ⋮ A Nested Lanczos Method for the Trust-Region Subproblem ⋮ A new regularized quasi-Newton algorithm for unconstrained optimization ⋮ On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization ⋮ Two globally convergent nonmonotone trust-region methods for unconstrained optimization ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality ⋮ An efficient algorithm for solving the generalized trust region subproblem ⋮ Parametric approach for correcting inconsistent linear equality system ⋮ Elastic 3D-2D image registration ⋮ On efficiently combining limited-memory and trust-region techniques ⋮ Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem ⋮ A modified nearly exact method for solving low-rank trust region subproblem ⋮ Globally Solving the Trust Region Subproblem Using Simple First-Order Methods ⋮ DrAmpl: A meta solver for optimization problem analysis ⋮ Canonical Dual Approach for Minimizing a Nonconvex Quadratic Function over a Sphere ⋮ Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems ⋮ 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 ⋮ A linear-time algorithm for the trust region subproblem based on hidden convexity ⋮ On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint ⋮ Least-squares symmetric solution to the matrix equationAXB=Cwith the norm inequality constraint ⋮ On the use of the energy norm in trust-region and adaptive cubic regularization subproblems ⋮ Efficient use of parallelism in algorithmic parameter optimization applications ⋮ Full Waveform Inversion and the Truncated Newton Method ⋮ A modified trust region method with beale's PCG technique for optimization ⋮ First-Order Methods for Nonconvex Quadratic Minimization ⋮ Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations ⋮ On the Generalized Lanczos Trust-Region Method ⋮ Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem ⋮ Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem ⋮ OFFO minimization algorithms for second-order optimality and their complexity ⋮ Newton-type methods for non-convex optimization under inexact Hessian information ⋮ 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 ⋮ A Block Lanczos Method for the Extended Trust-Region Subproblem ⋮ Iterative computation of negative curvature directions in large scale optimization ⋮ A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems ⋮ trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem ⋮ The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint ⋮ A matrix-free line-search algorithm for nonconvex optimization ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm ⋮ An inexact and nonmonotone proximal method for smooth unconstrained minimization ⋮ Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks ⋮ Updating the regularization parameter in the adaptive cubic regularization algorithm ⋮ A filter trust-region algorithm for unconstrained optimization with strong global convergence properties ⋮ Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results ⋮ A practical method for solving large-scale TRS ⋮ Global convergence of SSM for minimizing a quadratic over a sphere ⋮ On solving trust-region and other regularised subproblems in optimization ⋮ The trust region subproblem and semidefinite programming* ⋮ Affine conjugate adaptive Newton methods for nonlinear elastomechanics ⋮ Error bounds of Lanczos approach for trust-region subproblem ⋮ QPLIB: a library of quadratic programming instances ⋮ A Two-Variable Approach to the Two-Trust-Region Subproblem ⋮ On the global optimality of generalized trust region subproblems ⋮ The trust region subproblem with non-intersecting linear constraints ⋮ On the use of iterative methods in cubic regularization for unconstrained optimization ⋮ Adaptive regularization with cubics on manifolds ⋮ Error estimates for iterative algorithms for minimizing regularized quadratic subproblems ⋮ Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization ⋮ Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere ⋮ On Lagrange multipliers of trust-region subproblems ⋮ Trust-region and other regularisations of linear least-squares problems ⋮ Matrix-free algorithm for the large-scale constrained trust-region subproblem ⋮ New optimality conditions for quadratic optimization problems with binary constraints ⋮ HSL-VF05 ⋮ A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques ⋮ How much do approximate derivatives hurt filter methods? ⋮ Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step ⋮ An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty ⋮ Norm-constrained least-squares solutions to the matrix equation \(A X B = C\) ⋮ A penalty-free approach to PDE constrained optimization: application to an inverse wave problem ⋮ 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 ⋮ An adaptive high order method for finding third-order critical points of nonconvex optimization ⋮ An interior-point method for large constrained discrete ill-posed problems ⋮ Distributed quasi-Newton derivative-free optimization method for optimization problems with multiple local optima ⋮ Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization ⋮ 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 ⋮ A survey of truncated-Newton methods ⋮ Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method
Uses Software
This page was built for publication: Solving the Trust-Region Subproblem using the Lanczos Method
