Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem

DOI10.1137/21m1468073zbMath1522.90069arXiv2112.13821OpenAlexW4382065218MaRDI QIDQ6114784

Fatma Kılınç-Karzan, Alex L. Wang, Unnamed Author

Publication date: 12 July 2023

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

Full work available at URL: https://arxiv.org/abs/2112.13821

zbMATH Keywords

linear convergencegeneralized trust-region subproblemimplicit regularity

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Trust region subproblem with an additional linear inequality constraint
• A linear-time algorithm for trust region problems
• The generalized trust region subproblem
• Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
• Lectures on convex optimization
• Algorithms for the solution of quadratic knapsack problems
• An interior point algorithm to solve computationally difficult set covering problems
• SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
• Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
• Some results for quadratic problems with one or two quadratic constraints
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• The generalized trust region subproblem: solution complexity and convex hull results
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems
• Lectures on Modern Convex Optimization
• Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming
• Computing a Trust Region Step
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
• Trust Region Methods
• Consensus-ADMM for General Quadratically Constrained Quadratic Programming
• Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint
• The trust region subproblem and semidefinite programming*
• Solving the Trust-Region Subproblem using the Lanczos Method
• An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
• A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
• A Survey of the S-Lemma
• A Linear-Time Algorithm for Generalized Trust Region Subproblems

This page was built for publication: Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem