Pages that link to "Item:Q425468"
From MaRDI portal
The following pages link to Inexact smoothing method for large scale minimax optimization (Q425468):
Displaying 16 items.
- Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
- Successive smoothing algorithm for solving large-scale optimization models with fixed cost (Q492827) (← links)
- Group update method for sparse minimax problems (Q493251) (← links)
- A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
- On solving large-scale finite minimax problems using exponential smoothing (Q535071) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- A smoothing trust-region Newton-CG method for minimax problem (Q928081) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- An efficient approach to a class of non-smooth optimization problems (Q1326996) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← links)
- A dual algorithm for minimax problems (Q1767399) (← links)
- Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
- A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
- Hyperbolic smoothing function method for minimax problems (Q2841156) (← links)
- A truncated smoothing Newton method for \(l_\infty\) fitting rotated cones (Q3014357) (← links)
- A smoothing three-term conjugate gradient method for solving finite minimax problems (Q6665161) (← links)