An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint

DOI10.1016/j.cam.2022.114915zbMath1499.65232OpenAlexW4307512527MaRDI QIDQ2104089

Qingzhi Yang, Yaozong Tang, Gang Luo

Publication date: 9 December 2022

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2022.114915

zbMATH Keywords

global convergencequadratic programmingprojected gradient methodtrust region subproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)

Uses Software

• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• Multivariate polynomial minimization and its application in signal processing
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems
• Minimizing a Quadratic Over a Sphere
• Trace optimization and eigenproblems in dimension reduction methods
• Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
• Computing a Trust Region Step
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Some NP-complete problems in quadratic and nonlinear programming
• Newton’s Method with a Model Trust Region Modification
• Trust Region Methods
• Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
• Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
• Global convergence of SSM for minimizing a quadratic over a sphere
• Inverse Problem Theory and Methods for Model Parameter Estimation
• Solving the Trust-Region Subproblem using the Lanczos Method
• A Riemannian Optimization Approach to the Matrix Singular Value Decomposition
• Optimization algorithms exploiting unitary constraints