Group update method for sparse minimax problems
From MaRDI portal
Publication:493251
DOI10.1007/s10957-014-0646-zzbMath1327.90110OpenAlexW1980894803MaRDI QIDQ493251
Bo Yu, Mingsong Cheng, Shuting Zhang, Jun-Xiang Li
Publication date: 3 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0646-z
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Optimality conditions for minimax problems (49K35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Substitution secant/finite difference method to large sparse minimax problems
- Inexact smoothing method for large scale minimax optimization
- On solving large-scale finite minimax problems using exponential smoothing
- Algorithms with adaptive smoothing for finite minimax problems
- Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
- On the convergence of partitioning group correction algorithms
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- An interior-point algorithm for nonlinear minimax problems
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- Optimization. Algorithms and consistent approximations
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Superlinearly convergent algorithm for min-max problems
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- Portfolio Optimization Under a Minimax Rule
- Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
- On the Estimation of Sparse Hessian Matrices
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
- Min‐Max quickest path problems
