Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension

DOI10.1007/S10898-020-00985-XzbMATH Open1473.90108OpenAlexW3118587179MaRDI QIDQ2045012FDOQ2045012

Authors: Zhuoyi Xu, Yong Xia, Jiulin Wang 

Publication date: 11 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00985-x

Recommendations

• Faster, but weaker, relaxations for quadratically constrained quadratic programs
• scientific article; zbMATH DE number 169307
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
• A relaxation method for nonconvex quadratically constrained quadratic programs
• A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
• On convex relaxations for quadratically constrained quadratic programming
• Improved approximation bound for quadratic optimization problems with orthogonality constraints
• A new convex relaxation for quadratically constrained quadratic programming
• Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
• scientific article; zbMATH DE number 6474937

zbMATH Keywords

semidefinite programmingapproximation algorithmquadratic optimizationChebyshev center

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Semidefinite programming (90C22)

Cites Work

• Title not available (Why is that?)
• Semidefinite relaxation and nonconvex quadratic optimization
• New Results on Quadratic Minimization
• 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
• Title not available (Why is that?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Recent advances in trust region algorithms
• A semidefinite framework for trust region subproblems with applications to large scale minimization
• On maximization of quadratic form over intersection of ellipsoids with common center
• Approximating quadratic programming with bound and quadratic constraints
• Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
• The complexity of approximating a nonlinear program
• Title not available (Why is that?)
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
• On affine scaling algorithms for nonconvex quadratic programming
• A generalization of Löwner-John's ellipsoid theorem
• Approximation algorithms for quadratic programming
• Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
• On the solution of a two ball trust region subproblem
• A survey of hidden convex optimization
• Polynomial Solvability of Variants of the Trust-Region Subproblem
• Chebyshev center of the intersection of balls: complexity, relaxation and approximation
• Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints

Cited In (4)

• Covering a set by a convex compactum: error estimates and computation
• Chebyshev center of the intersection of balls: complexity, relaxation and approximation
• Chebyshev center and inscribed balls: properties and calculations
• On Chebyshev center of the intersection of two ellipsoids

This page was built for publication: Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045012)