Pages that link to "Item:Q632859"
From MaRDI portal
The following pages link to Nonmonotone algorithm for minimax optimization problems (Q632859):
Displaying 12 items.
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664) (← links)
- Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
- A nonmonotone line search based algorithm for distribution center location selected (Q477492) (← links)
- An efficient approach to nonlinear minimax problems (Q1203873) (← links)
- Nonmonotone line search for minimax problems (Q1321311) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← 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)
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
- The optimality conditions for generalized minimax programming (Q2453279) (← links)
- A New Trust-Region Algorithm for Finite Minimax Problem (Q4901368) (← links)