Nonmonotone algorithm for minimax optimization problems
From MaRDI portal
Publication:632859
DOI10.1016/j.amc.2011.01.002zbMath1215.65114OpenAlexW1967901732MaRDI QIDQ632859
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
superlinear convergenceminimax optimization problemhybrid techniquesecond-order correctionalgorithm with nonmonotone strategy
Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30)
Related Items (6)
A nonmonotonic hybrid algorithm for min-max problem ⋮ Substitution secant/finite difference method to large sparse minimax problems ⋮ A QP-free algorithm for finite minimax problems ⋮ An adaptive nonmonotone trust-region method with curvilinear search for minimax problem ⋮ The optimality conditions for generalized minimax programming ⋮ Improved filter-SQP algorithm with active set for constrained minimax problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
- An improved SQP algorithm for solving minimax problems
- Nonmonotonic trust region algorithm
- Nonmonotone line search for minimax problems
- Nonmonotone line search algorithm for constrained minimax problems
- A nonmonotone adaptive trust region method and its convergence
- A quasi-Newton trust-region method
- Nonmonotone trust region method for solving optimization problems
- On the convergence of a new trust region algorithm
- A hybrid algorithm for nonlinear minimax problems
- Superlinearly convergent algorithm for min-max problems
- A new superlinearly convergent SQP algorithm for nonlinear minimax 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
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- On the global convergence of trust region algorithms for unconstrained minimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- A model algorithm for composite nondifferentiable optimization problems
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- A modified SQP method with nonmonotone linesearch technique.
This page was built for publication: Nonmonotone algorithm for minimax optimization problems
