Nonmonotone algorithm for minimax optimization problems
DOI10.1016/J.AMC.2011.01.002zbMATH Open1215.65114OpenAlexW1967901732MaRDI QIDQ632859FDOQ632859
Authors: Fu-Sheng Wang, Yanping Wang 
Publication date: 28 March 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.01.002
Recommendations
- Nonmonotone line search algorithm for constrained minimax problems
- A new trust-region algorithm for finite minimax problems
- Generalized monotone line search SQP algorithm for constrained minimax problems
- A new non-monotone SQP algorithm for the minimax problem
- A nonmonotone filter method for minimax problems
superlinear convergencehybrid techniquesecond-order correctionalgorithm with nonmonotone strategyminimax optimization problem
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)
Cites Work
- Title not available (Why is that?)
- A Nonmonotone Line Search Technique for Newton’s Method
- Nonmonotonic trust region algorithm
- A quasi-Newton trust-region method
- Nonmonotone trust region method for solving optimization problems
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- A new pruning test for finding all global minimizers of nonsmooth functions
- Nonmonotone line search for minimax problems
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- On the convergence of a new trust region algorithm
- An improved SQP algorithm for solving minimax problems
- Nonmonotone line search algorithm for constrained minimax problems
- A hybrid algorithm for nonlinear minimax problems
- Superlinearly convergent algorithm for min-max problems
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- On the global convergence of trust region algorithms for unconstrained minimization
- Title not available (Why is that?)
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- A modified SQP method with nonmonotone linesearch technique.
- Title not available (Why is that?)
- A model algorithm for composite nondifferentiable optimization problems
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A nonmonotone adaptive trust region method and its convergence
- Title not available (Why is that?)
- A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
Cited In (15)
- A QP-free algorithm for finite minimax problems
- A nonmonotone line search algorithm for nonsmooth discrete minimax problem
- Improved filter-SQP algorithm with active set for constrained minimax problems
- A hybrid algorithm for nonlinear minimax problems
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- The optimality conditions for generalized minimax programming
- A nonmonotonic hybrid algorithm for min-max problem
- An efficient approach to nonlinear minimax problems
- Nonmonotone line search for minimax problems
- A nonmonotone line search based algorithm for distribution center location selected
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem
- On the complexity of the exchange algorithm for minimax optimization problems
- A new trust-region algorithm for finite minimax problems
- Generalised monotone line search algorithm for degenerate nonlinear minimax problems
- Substitution secant/finite difference method to large sparse minimax problems
This page was built for publication: Nonmonotone algorithm for minimax optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632859)
