Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
type: Item
instance of: scholarly article
title: Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
zbMATH Open document ID: 1473.90108
author: Zhuoyi Xu
author: Yong Xia
author: Jiulin Wang
published in: Journal of Global Optimization
publication date: 2021-08-11T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7380935
zbMATH Keywords: quadratic optimization
zbMATH Keywords: semidefinite programming
zbMATH Keywords: approximation algorithm
zbMATH Keywords: Chebyshev center
MaRDI profile type: Publication
full work available at URL: s10898-020-00985-x
OpenAlex ID: W3118587179
cites work: Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
cites work: On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
cites work: Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
cites work: The complexity of approximating a nonlinear program
cites work: Polynomial Solvability of Variants of the Trust-Region Subproblem
cites work: Q3681854
cites work: Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
cites work: Approximation algorithms for quadratic programming
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: On the solution of a two ball trust region subproblem
cites work: Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
cites work: A generalization of Löwner-John's ellipsoid theorem
cites work: On maximization of quadratic form over intersection of ellipsoids with common center
cites work: Semidefinite relaxation and nonconvex quadratic optimization
cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization
cites work: Q3802887
cites work: Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
cites work: Q3137900
cites work: A survey of hidden convex optimization
cites work: Chebyshev center of the intersection of balls: complexity, relaxation and approximation
cites work: On affine scaling algorithms for nonconvex quadratic programming
cites work: Approximating quadratic programming with bound and quadratic constraints
cites work: New Results on Quadratic Minimization
cites work: Recent advances in trust region algorithms
DOI: 10.1007/S10898-020-00985-X
Recommended article: Faster, but weaker, relaxations for quadratically constrained quadratic programs
Recommended article: Q4037980
Recommended article: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
Recommended article: A relaxation method for nonconvex quadratically constrained quadratic programs
Recommended article: A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
Recommended article: On convex relaxations for quadratically constrained quadratic programming
Recommended article: Q4633935
Recommended article: A new convex relaxation for quadratically constrained quadratic programming
Recommended article: Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
Recommended article: Q2941669
description: scientific article; zbMATH DE number 7380935