Group Update Method for Sparse Minimax Problems

Junxiang Li (), Mingsong Cheng (), Bo Yu () and Shuting Zhang ()
Additional contact information
Junxiang Li: University of Shanghai for Science & Technology
Mingsong Cheng: Dalian University of Technology
Bo Yu: Dalian University of Technology
Shuting Zhang: Jilin University

Journal of Optimization Theory and Applications, 2015, vol. 166, issue 1, No 12, 257-277

Abstract: Abstract A group update algorithm is presented for solving minimax problems with a finite number of functions, whose Hessians are sparse. The method uses the gradient evaluations as efficiently as possible by updating successively the elements in partitioning groups of the columns of every Hessian in the process of iterations. The chosen direction is determined directly by the nonzero elements of the Hessians in terms of partitioning groups. The local $$q$$ q -superlinear convergence of the method is proved, without requiring the imposition of a strict complementarity condition, and the $$r$$ r -convergence rate is estimated. Furthermore, two efficient methods handling nonconvex case are given. The global convergence of one method is proved, and the local $$q$$ q -superlinear convergence and $$r$$ r -convergence rate of another method are also proved or estimated by a novel technique. The robustness and efficiency of the algorithms are verified by numerical tests.

Keywords: Minimax problem; Nondifferentiable optimization; Sparsity; Large scale; Group update; 90C06; 90C30; 65K10; 49K35 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-014-0646-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:166:y:2015:i:1:d:10.1007_s10957-014-0646-z

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-014-0646-z

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().