An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem

DOI10.1007/s10589-020-00237-4zbMath1468.90141OpenAlexW3105435624MaRDI QIDQ2026775

Jingjing Shen, Weiwei Pan, Zi Xu

Publication date: 20 May 2021

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-020-00237-4

zbMATH Keywords

complexity analysisnonconvex-linear minimax problemweighted maximin dispersion problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (3)

A stochastic primal-dual method for a class of nonconvex constrained optimization ⋮ Zeroth-order single-loop algorithms for nonconvex-linear minimax problems ⋮ New approximation algorithms for weighted maximin dispersion problem with box or ball constraints

Uses Software

• SBEED

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading
• An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
• On the Ball-Constrained Weighted Maximin Dispersion Problem
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Convex Relaxations of the Weighted Maxmin Dispersion Problem
• Prediction, Learning, and Games
• Benchmarking optimization software with performance profiles.

This page was built for publication: An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem