An adaptive smoothing method for continuous minimax problems
From MaRDI portal
cautious BFGS methodglobal convergencepolynomial interpolationsemi-infinite continuous minimax problemsmoothing methodsteepest descent method
Optimality conditions for minimax problems (49K35) Stochastic network models in operations research (90B15) Production models (90B30) Nonlinear programming (90C30) Semi-infinite programming (90C34) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47) Methods of quasi-Newton type (90C53)
Recommendations
- Smoothing method for minimax problems
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Algorithms with adaptive smoothing for finite minimax problems
- A spline smoothing Newton method for semi-infinite minimax problems
- Error bounds of two smoothing approximations for semi-infinite minimax problems
Cites work
- A non-interior continuation method for generalized linear complementarity problems
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- A smooth method for the finite minimax problem
- A smoothing-out technique for min—max optimization
- A surperlinearly convergent algorithm for constrained optimization problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Algorithms with adaptive smoothing for finite minimax problems
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- An Efficient Method to Solve the Minimax Problem Directly
- Combined phase I—phase II methods of feasible directions
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- How good can polynomial interpolation on the sphere be?
- Nondifferential optimization via adaptive smoothing
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Smooth Optimization Methods for Minimax Problems
- Smoothing method for minimax problems
- Superlinearly convergent algorithm for min-max problems
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(14)- Error bounds of two smoothing approximations for semi-infinite minimax problems
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- On a new smoothing technique for non-smooth, non-convex optimization
- Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
- A spline smoothing Newton method for semi-infinite minimax problems
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- Minimal realization and dynamic properties of optimal smoothers
- A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
- Smoothing method for minimax problems
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Algorithms with adaptive smoothing for finite minimax problems
- A new approach for solving minimax problems using new generation smoothing techniques
- A new smoothing function technique for solving minimax problems
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
This page was built for publication: An adaptive smoothing method for continuous minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5245835)
