Further study on a dual algorithm
From MaRDI portal
Publication:2483769
DOI10.1007/S11766-005-0057-XzbMATH Open1126.90420OpenAlexW2313228020MaRDI QIDQ2483769FDOQ2483769
Authors: Hua Han, Suxiang He
Publication date: 27 July 2005
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-005-0057-x
Recommendations
Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35)
Cites Work
- Smooth Optimization Methods for Minimax Problems
- Title not available (Why is that?)
- A smooth method for the finite minimax problem
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Title not available (Why is that?)
- Convergence of a dual algorithm for minimax problems
- Nonlinear leastpth optimization and nonlinear programming
- Smooth transformation of the generalized minimax problem
- Nonlinear rescaling in discrete minimax
Cited In (7)
- Further analysis of the remedian algorithm
- A dual algorithm for minimax problems
- Title not available (Why is that?)
- Computational study of the GDPO dual phase-1 algorithm
- A mathematical convergence analysis of the dual method by expansion of original/reciprocal variables based on the cumulative information at two points
- A dual algorithm for minimization of the LLT model
- Convergence of a dual algorithm for minimax problems
This page was built for publication: Further study on a dual algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483769)