A smoothing iterative method for the finite minimax problem
From MaRDI portal
Publication:2306388
DOI10.1016/j.cam.2020.112741zbMath1432.90146OpenAlexW3003679685MaRDI QIDQ2306388
Publication date: 23 March 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2020.112741
Related Items
Cites Work
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- Inexact smoothing method for large scale minimax optimization
- Algorithms with adaptive smoothing for finite minimax problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Approximation procedures based on the method of multipliers
- New minimax algorithm
- Computational schemes for large-scale problems in extended linear- quadratic programming
- Minimax and applications
- A non-interior continuation method for generalized linear complementarity problems
- Nonlinear programming using minimax techniques
- Personnel Tour Scheduling When Starting-Time Restrictions Are Present
- New three-term conjugate gradient method with guaranteed global convergence
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- On Penalty and Multiplier Methods for Constrained Minimization
- An Efficient Method to Solve the Minimax Problem Directly
- A Note on Performance Profiles for Benchmarking Software
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Smoothing method for minimax problems
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
