Pages that link to "Item:Q531696"
From MaRDI portal
The following pages link to On the accurate identification of active set for constrained minimax problems (Q531696):
Displayed 9 items.
- Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
- New active set identification for general constrained optimization and minimax problems (Q743206) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)