Inexact smoothing method for large scale minimax optimization
From MaRDI portal
Publication:425468
DOI10.1016/J.AMC.2011.08.017zbMATH Open1244.65082OpenAlexW2003464037MaRDI QIDQ425468FDOQ425468
Authors: Jiazhen Huo, Junxiang Li 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Computing a Trust Region Step
- Numerical Optimization
- Title not available (Why is that?)
- Optimization. Algorithms and consistent approximations
- Approximation procedures based on the method of multipliers
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Inexact Newton Methods
- Title not available (Why is that?)
- Personnel tour scheduling when starting-time restrictions are present
- Algorithms with adaptive smoothing for finite minimax problems
- Enlarging the region of convergence of Newton's method for constrained optimization
- Nonmonotone line search for minimax problems
- Title not available (Why is that?)
- Smoothing method for minimax problems
- New minimax algorithm
- Superlinearly convergent algorithm for min-max problems
- An Efficient Method to Solve the Minimax Problem Directly
- On the Estimation of Sparse Hessian Matrices
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
- Title not available (Why is that?)
- An interior-point algorithm for nonlinear minimax problems
- A non-interior continuation method for generalized linear complementarity problems
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
- On the convergence of partitioning group correction algorithms
Cited In (19)
- Hyperbolic smoothing function method for minimax problems
- A smoothing trust-region Newton-CG method for minimax problem
- A smoothing trust-region Newton-CG method for minimax problems
- A dual algorithm for minimax problems
- A QP-free algorithm for finite minimax problems
- An efficient approach to a class of non-smooth optimization problems
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- On solving large-scale finite minimax problems using exponential smoothing
- Algorithms with adaptive smoothing for finite minimax problems
- A first-order smoothing method for minimizing the sum of the \(r\)-largest functions
- A truncated smoothing Newton method for \(l_\infty\) fitting rotated cones
- Smoothing method for minimax problems
- Group update method for sparse minimax problems
- Successive smoothing algorithm for solving large-scale optimization models with fixed cost
- A smoothing iterative method for the finite minimax problem
- A smoothing three-term conjugate gradient method for solving finite minimax problems
- A truncated aggregate smoothing Newton method for minimax problems
- Substitution secant/finite difference method to large sparse minimax problems
- A spline smoothing Newton method for finite minimax problems
Uses Software
This page was built for publication: Inexact smoothing method for large scale minimax optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425468)
