Pages that link to "Item:Q3883931"
From MaRDI portal
The following pages link to Combined lp and quasi-Newton methods for minimax optimization (Q3883931):
Displayed 22 items.
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- An \(\epsilon\)-active barrier-function method for solving minimax problems (Q806678) (← links)
- A note on the regularization of discrete approximation problems (Q921320) (← links)
- Variable metric methods for linearly constrained nonlinear minimax approximation (Q1051247) (← links)
- An algorithm for composite nonsmooth optimization problems (Q1057188) (← links)
- A compact variable metric algorithm for nonlinear minimax approximation (Q1062915) (← links)
- Global convergence of quasi-Newton-type algorithms for some nonsmooth optimization problems (Q1166101) (← links)
- A constrained min-max algorithm for rival models of the same economic system (Q1184350) (← links)
- A barrier function method for minimax problems (Q1186276) (← links)
- Nondifferentiable optimization via smooth approximation: General analytical approach (Q1207839) (← links)
- Hybrid methods for solving the educational testing problem (Q1298524) (← links)
- A projected conjugate gradient method for sparse minimax problems (Q1315210) (← links)
- Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- Discontinuous piecewise linear optimization (Q1380942) (← links)
- Active set strategies in an ellipsoid algorithm for nonlinear programming (Q1433159) (← links)
- A dual algorithm for minimax problems (Q1767399) (← links)
- Superlinearly convergent algorithm for min-max problems (Q2277156) (← links)
- An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
- (Q3757284) (← links)
- Solving nonlinear programming problems with very many constraints (Q4327941) (← links)
