An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem

DOI10.3934/jimo.2020007zbMath1474.90287OpenAlexW3000015444MaRDI QIDQ2031386

Jinjin Huang, Siwen Wang, Zi Xu

Publication date: 9 June 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020007

zbMATH Keywords

successive convex approximationblock successive upper bound minimizationmaximin dispersion problemmaximum improvement successive upper-bound minimization

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Estimation and detection in stochastic control theory (93E10)

Related Items (2)

An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem ⋮ New approximation algorithms for weighted maximin dispersion problem with box or ball constraints

Uses Software

• CVX

Cites Work

• Unnamed Item
• Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading
• A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
• Maximum Block Improvement and Polynomial Optimization
• On the Ball-Constrained Weighted Maximin Dispersion Problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A Maxmin Location Problem
• Heuristic and Special Case Algorithms for Dispersion Problems
• Fast Approximation Algorithms for a Class of Non-convex QCQP Problems Using First-Order Methods
• Convex Relaxations of the Weighted Maxmin Dispersion Problem
• Convex Analysis

This page was built for publication: An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem