On the Ball-Constrained Weighted Maximin Dispersion Problem

DOI10.1137/15M1047167zbMath1346.90659arXiv1604.02212OpenAlexW2963433083MaRDI QIDQ3187980

Yong Xia, Shu Wang

Publication date: 16 August 2016

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02212

zbMATH Keywords

approximation algorithmconvex relaxationsecond-order cone programmingmaximin dispersion

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming ⋮ Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading ⋮ Covering a simplex by spheres: complexity and algorithms ⋮ A stochastic primal-dual method for a class of nonconvex constrained optimization ⋮ A survey of hidden convex optimization ⋮ Linear Programming on the Stiefel Manifold ⋮ An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem ⋮ An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem ⋮ New approximation algorithms for weighted maximin dispersion problem with box or ball constraints

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• An algorithm for uniform random sampling of points in and on a hypersphere
• Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
• Updating the Inverse of a Matrix
• A Maxmin Location Problem
• Trust Region Methods
• Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
• Probability Bounds for Polynomial Functions in Random Variables
• Convex Relaxations of the Weighted Maxmin Dispersion Problem
• A hybrid model-classifier framework for managing prediction uncertainty in expensive optimisation problems

This page was built for publication: On the Ball-Constrained Weighted Maximin Dispersion Problem