Pages that link to "Item:Q4164738"
From MaRDI portal
The following pages link to An Efficient Method to Solve the Minimax Problem Directly (Q4164738):
Displaying 12 items.
- Residual Selection in A Projection Method for Convex Minimization Problems (Q4430670) (← links)
- Computation of generalized <i>H</i> <sub>2</sub> optimal controllers (Q4841405) (← links)
- A new algorithm for minimax and<i>l</i><sub>1</sub>-norm optimization (Q4944416) (← links)
- An aggregate homotopy method for solving unconstrained minimax problems (Q5009167) (← links)
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
- An Adaptive Smoothing Method for Continuous Minimax Problems (Q5245835) (← links)
- New limited memory bundle method for large-scale nonsmooth optimization (Q5460656) (← links)
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574) (← links)
- Solving fuzzy variational inequalities over a compact set (Q5936077) (← links)
- Composite nonsmooth optimization using approximate generalized gradient vectors (Q5959905) (← links)
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization (Q6642790) (← links)
- A smoothing three-term conjugate gradient method for solving finite minimax problems (Q6665161) (← links)