On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint

DOI10.1080/01630563.2020.1733605zbMath1464.90052OpenAlexW3010665022MaRDI QIDQ5107288

Akram Taati, Maziar Salahi

Publication date: 21 April 2020

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2020.1733605

zbMATH Keywords

global optimizationgeneralized eigenvalue problemlocal minimizerquadratically constrained quadratic optimization

Mathematics Subject Classification ID

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

Related Items (1)

On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints

Uses Software

• GQTPAR
• HSL-VF05

Cites Work

• Unnamed Item
• Unnamed Item
• The generalized trust region subproblem
• Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
• Strong duality for generalized trust region subproblem: S-lemma with interval bounds
• Local nonglobal minima for solving large-scale extended trust-region subproblems
• Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
• On solving trust-region and other regularised subproblems in optimization
• Finding a positive definite linear combination of two Hermitian matrices
• On the solution of a two ball trust region subproblem
• A semidefinite framework for trust region subproblems with applications to large scale minimization
• SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
• 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
• 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
• Recent advances in trust region algorithms
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems
• A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
• Lectures on Modern Convex Optimization
• Solving Generalized CDT Problems via Two-Parameter Eigenvalues
• A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil
• Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
• Computing a Trust Region Step
• An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
• New Results on Quadratic Minimization
• Trust Region Methods
• 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
• Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
• Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
• Nonlinear Programming

This page was built for publication: On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint