Pages that link to "Item:Q363595"
From MaRDI portal
The following pages link to A hybrid algorithm for linearly constrained minimax problems (Q363595):
Displaying 14 items.
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- A forward maximum principle algorithm with decision horizon results (Q1094104) (← links)
- An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
- An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems (Q1721098) (← 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)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
- A hybrid algorithm for infinitely constrained optimization (Q3153862) (← links)
- 基于混合搜索的含逻辑“与”“或”的RM优化算法 (Q3175570) (← links)
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
- A hybrid method fur linearly constrained optimisation problems (Q3735487) (← links)
- (Q3807002) (← links)
- (Q5277161) (← links)