Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Distributed MIN-MAX Optimization Application to Time-optimal Consensus:
  An Alternating Projection Approach   In this paper, we proposed an alternating projection based algorithm to solve
a class of distributed MIN-MAX convex optimization problems. We firstly
transform this MINMAX problem into the problem of searching for the minimum
distance between some hyper-plane and the intersection of the epigraphs of
convex functions. The Bregman's alternating method is employed in our algorithm
to achieve the distance by iteratively projecting onto the hyper-plane and the
intersection. The projection onto the intersection is obtained by cyclic
Dykstra's projection method. We further apply our algorithm to the minimum time
multi-agent consensus problem. The attainable states set for the agent can be
transformed into the epigraph of some convex functions, and the search for
time-optimal state for consensus satisfies the MIN-MAX problem formulation.
Finally, the numerous simulation proves the validity of our algorithm.

30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
9
The categories of this paper are: nlin
24
The categories of this paper are: dg-ga
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
25
The categories of this paper are: patt-sol
3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
11
The categories of this paper are: hep-lat