Maximization of a PSD quadratic form and factorization
From MaRDI portal
Recommendations
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
- scientific article; zbMATH DE number 1054751
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- New bounds on the unconstrained quadratic integer programming problem
- On maximization of quadratic form over intersection of ellipsoids with common center
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- A new algorithm for concave quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Computational complexity and feasibility of data processing and interval computations
- Computing the norm ∥A∥∞,1 is NP-hard∗
- Convex analysis and global optimization
- Global optimization. Theory, algorithms, and applications
- Linear Optimization Problems with Inexact Data
- MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
- Methods for Global Concave Minimization: A Bibliographic Survey
- Nonlinear Programming
- Polynomial time weak approximation algorithms for quadratic programming
- Regularity radius: properties, approximation and a not a priori exponential algorithm
- The complexity of computation and approximation of the t-ratio over one-dimensional interval data
- Tight bounds on the radius of nonsingularity
This page was built for publication: Maximization of a PSD quadratic form and factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230781)
