Pages that link to "Item:Q3988950"
From MaRDI portal
The following pages link to On the Extension of Newton’s Method to Semi-Infinite Minimax Problems (Q3988950):
Displaying 12 items.
- Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
- Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
- Group update method for sparse minimax problems (Q493251) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming (Q732375) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
- On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems (Q1321655) (← links)
- An efficient algorithm for solving semi-infinite inequality problems with box constraints (Q1334924) (← links)
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
- Asymptotic surrogate constraint method and its convergence for a class of semi-infinite programming (Q1970753) (← links)
- A spline smoothing Newton method for semi-infinite minimax problems (Q2336781) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
