An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
DOI10.1016/J.CAM.2022.114915zbMATH Open1499.65232OpenAlexW4307512527MaRDI QIDQ2104089FDOQ2104089
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
Recommendations
- A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
- scientific article; zbMATH DE number 1839735
- Convergence properties of projected gradient methods with nonmonotonic back tracking technique for convex constrained optimization
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30)
Cites Work
- Computing a Trust Region Step
- A feasible method for optimization with orthogonality constraints
- Solving the Trust-Region Subproblem using the Lanczos Method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trace optimization and eigenproblems in dimension reduction methods.
- Some NP-complete problems in quadratic and nonlinear programming
- Trust Region Methods
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Title not available (Why is that?)
- Multivariate polynomial minimization and its application in signal processing
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Title not available (Why is that?)
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Title not available (Why is that?)
- Newton’s Method with a Model Trust Region Modification
- Minimizing a quadratic over a sphere
- Optimization algorithms exploiting unitary constraints
- A Riemannian Optimization Approach to the Matrix Singular Value Decomposition
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- Global convergence of SSM for minimizing a quadratic over a sphere
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
Uses Software
This page was built for publication: An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104089)
