On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
From MaRDI portal
Publication:3988950
Recommendations
- A spline smoothing Newton method for semi-infinite minimax problems
- Semismooth Newton methods for solving semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- Global convergence of a semi-infinite optimization method
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
Cited in
(12)- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- A spline smoothing Newton method for semi-infinite minimax problems
- An efficient algorithm for solving semi-infinite inequality problems with box constraints
- Algorithms with adaptive smoothing for finite minimax problems
- A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Group update method for sparse minimax problems
- Substitution secant/finite difference method to large sparse minimax problems
- Inexact smoothing method for large scale minimax optimization
- Asymptotic surrogate constraint method and its convergence for a class of semi-infinite programming
This page was built for publication: On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988950)