Inexact smoothing method for large scale minimax optimization
From MaRDI portal
Publication:425468
DOI10.1016/j.amc.2011.08.017zbMath1244.65082OpenAlexW2003464037MaRDI QIDQ425468
Publication date: 8 June 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.08.017
Related Items
Substitution secant/finite difference method to large sparse minimax problems ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ A QP-free algorithm for finite minimax problems ⋮ Group update method for sparse minimax problems ⋮ A smoothing iterative method for the finite minimax problem
Uses Software
Cites Work
- 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 interior-point algorithm for nonlinear minimax problems
- Enlarging the region of convergence of Newton's method for constrained optimization
- Approximation procedures based on the method of multipliers
- New minimax algorithm
- Nonmonotone line search for minimax problems
- Optimization. Algorithms and consistent approximations
- A non-interior continuation method for generalized linear complementarity problems
- Superlinearly convergent algorithm for min-max problems
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
- Personnel Tour Scheduling When Starting-Time Restrictions Are Present
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Computing a Trust Region Step
- On the Estimation of Sparse Hessian Matrices
- Inexact Newton Methods
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
- An Efficient Method to Solve the Minimax Problem Directly
- Numerical Optimization
- Smoothing method for minimax problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
