An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
type: Item
instance of: scholarly article
title: An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
zbMATH Open document ID: 1468.90141
author: Weiwei Pan
author: Jingjing Shen
author: Zi Xu
published in: Computational Optimization and Applications
publication date: 2021-05-20T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 7350288
zbMATH Keywords: nonconvex-linear minimax problem
zbMATH Keywords: complexity analysis
zbMATH Keywords: weighted maximin dispersion problem
describes a project that uses: SBEED
MaRDI profile type: Publication
full work available at URL: s10589-020-00237-4
OpenAlex ID: W3105435624
cites work: Prediction, Learning, and Games
cites work: Benchmarking optimization software with performance profiles.
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Convex Relaxations of the Weighted Maxmin Dispersion Problem
cites work: On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
cites work: Q4486593
cites work: On the Ball-Constrained Weighted Maximin Dispersion Problem
cites work: Q4887837
cites work: Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading
cites work: Robustness and regularization of support vector machines
cites work: An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
DOI: 10.1007/S10589-020-00237-4
description: scientific article; zbMATH DE number 7350288