Nonmonotone algorithm for minimax optimization problems
The paper deals with finite minimax optimization problems \[ \min_{x\in\mathbb{R}^n}\;\max_{1\leq i\leq m}\, f_i(x), \] where all functions \(f_i\) are twice continuously differentiable. Equivalently, the function \(\Phi(x)= \max f_i(x)\) is to minimize. The problem is not necessarily differentiable, but it is possible to transform the task to a differentiable programming problem with side conditions (inequalities). The authors introduce a nonmonotone algorithm for the construction of a minimizing sequence. The algorithm takes not only the advantage of nonmonotone strategy and second-order step but also the advantages of trust-region methods and line search methods. The new algorithm is of strongly global convergence and superlinear convergence. Numerical experiments (10 examples) indicate the efficiency.
- 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
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
- A hybrid algorithm for nonlinear minimax problems
- A model algorithm for composite nondifferentiable optimization problems
- A modified SQP method with nonmonotone linesearch technique.
- A new pruning test for finding all global minimizers of nonsmooth functions
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- A nonmonotone adaptive trust region method and its convergence
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- A quasi-Newton trust-region method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An improved SQP algorithm for solving minimax problems
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- scientific article; zbMATH DE number 3748332 (Why is no real title available?)
- scientific article; zbMATH DE number 16320 (Why is no real title available?)
- scientific article; zbMATH DE number 1932369 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Nonmonotone line search algorithm for constrained minimax problems
- Nonmonotone line search for minimax problems
- Nonmonotone trust region method for solving optimization problems
- Nonmonotonic trust region algorithm
- On the convergence of a new trust region algorithm
- On the global convergence of trust region algorithms for unconstrained minimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Superlinearly convergent algorithm for min-max problems
- An efficient approach to nonlinear minimax problems
- Nonmonotone line search for minimax problems
- A QP-free algorithm for finite minimax problems
- A hybrid algorithm for nonlinear minimax problems
- Improved filter-SQP algorithm with active set for constrained minimax problems
- A nonmonotonic hybrid algorithm for min-max problem
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- The optimality conditions for generalized minimax programming
- 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
- Substitution secant/finite difference method to large sparse minimax problems
- A nonmonotone line search based algorithm for distribution center location selected
- A new trust-region algorithm for finite minimax problems
- A nonmonotone line search algorithm for nonsmooth discrete minimax problem
- Generalised monotone line search algorithm for degenerate nonlinear minimax problems
- A J-symmetric quasi-Newton method for 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)
