Pages that link to "Item:Q1935267"
From MaRDI portal
The following pages link to Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267):
Displaying 9 items.
- Optimality functions and lopsided convergence (Q301730) (← links)
- 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)
- Group update method for sparse minimax problems (Q493251) (← links)
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems (Q3988950) (← links)
- A tight smooth approximation of the maximum function and its applications (Q5055095) (← links)
- Discretization in semi-infinite programming: the rate of convergence (Q5955561) (← links)
- Consistent approximations in composite optimization (Q6165588) (← links)