Pages that link to "Item:Q2277156"
From MaRDI portal
The following pages link to Superlinearly convergent algorithm for min-max problems (Q2277156):
Displayed 13 items.
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- A modified SQP algorithm for minimax problems (Q837129) (← links)
- An improved SQP algorithm for solving minimax problems (Q1021864) (← links)
- An efficient algorithm for solving semi-infinite inequality problems with box constraints (Q1334924) (← links)
- On the entropic regularization method for solving min-max problems with applications (Q1366322) (← links)
- Smooth transformation of the generalized minimax problem (Q1372537) (← links)
- A dual algorithm for minimax problems (Q1767399) (← links)
- Solving min-max problems and linear semi-infinite programs (Q1816663) (← links)
- A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation (Q2383749) (← links)
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786) (← links)
- A sequential quadratic programming algorithm for nonlinear minimax problems (Q5301244) (← links)