Pages that link to "Item:Q2277156"
From MaRDI portal
The following pages link to Superlinearly convergent algorithm for min-max problems (Q2277156):
Displaying 28 items.
- A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
- Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
- Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
- Group update method for sparse minimax problems (Q493251) (← links)
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- New exact penalty function for solving constrained finite min-max problems (Q764635) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← 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 QP-free algorithm for finite minimax problems (Q1724124) (← links)
- A dual algorithm for minimax problems (Q1767399) (← 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)
- Improved filter-SQP algorithm with active set for constrained minimax problems (Q2336309) (← links)
- A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation (Q2383749) (← links)
- Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786) (← links)
- (Q3384760) (← links)