The following pages link to New minimax algorithm (Q1321280):
Displaying 27 items.
- A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
- Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
- A new objective penalty function approach for solving constrained minimax problems (Q489101) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- A modified SQP algorithm for minimax problems (Q837129) (← links)
- A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy (Q864760) (← links)
- A smoothing trust-region Newton-CG method for minimax problem (Q928081) (← links)
- On the convergence of the Pshenichnyi-Pironneau-Polak minimax algorithm with an active set strategy (Q939106) (← links)
- An improved SQP algorithm for solving minimax problems (Q1021864) (← links)
- On the entropic regularization method for solving min-max problems with applications (Q1366322) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← links)
- Solving min-max problems and linear semi-infinite programs (Q1816663) (← links)
- An active-set algorithm and a trust-region approach in constrained minimax problem (Q1993563) (← links)
- A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
- A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints (Q2299749) (← links)
- A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- A trust-region method by active-set strategy for general nonlinear optimization (Q2460581) (← links)
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786) (← links)
- The optimization technique for solving a class of non-differentiable programming based on neural network method (Q2655120) (← links)
- (Q3972973) (← links)
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
- Add-in for solvers of unconstrained minimization to eliminate lower bounds of variables by transformation (Q5146274) (← links)
- A sequential quadratic programming algorithm for nonlinear minimax problems (Q5301244) (← links)
- (Q5469780) (← links)
- Generalised monotone line search algorithm for degenerate nonlinear minimax problems (Q5485718) (← links)
- A smoothing three-term conjugate gradient method for solving finite minimax problems (Q6665161) (← links)
