Maximization of a PSD quadratic form and factorization

DOI10.1007/s11590-020-01624-wzbMath1477.90071OpenAlexW3046976858MaRDI QIDQ2230781

Moslem Zamani, Milan Hladík, David Hartman

Publication date: 28 September 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01624-w

zbMATH Keywords

upper boundpreconditioningNP-hardnessmaximum normconcave programmingconvex quadratic form

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Computational complexity and feasibility of data processing and interval computations
• The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
• A new algorithm for concave quadratic programming
• Tight Bounds on the Radius of Nonsingularity
• Methods for Global Concave Minimization: A Bibliographic Survey
• MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
• Computing the norm ∥A∥∞,1 is NP-hard^∗
• Regularity radius: Properties, approximation and a not a priori exponential algorithm
• Nonlinear Programming
• Linear Optimization Problems with Inexact Data
• Convex analysis and global optimization

This page was built for publication: Maximization of a PSD quadratic form and factorization