A hybrid algorithm for nonlinear minimax problems
From MaRDI portal
Publication:2271823
DOI10.1007/s10479-008-0401-7zbMath1171.90544OpenAlexW2119922163MaRDI QIDQ2271823
Publication date: 4 August 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0401-7
Related Items
A nonmonotonic hybrid algorithm for min-max problem, A hybrid algorithm for linearly constrained minimax problems, A model-hybrid approach for unconstrained optimization problems, Nonmonotone algorithm for minimax optimization problems, An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems, An adaptive nonmonotone trust-region method with curvilinear search for minimax problem, A new objective penalty function approach for solving constrained minimax problems, An active-set algorithm and a trust-region approach in constrained minimax problem, Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems, A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem, A proximal-projection partial bundle method for convex constrained minimax problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A smooth method for the finite minimax problem
- A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
- A compact variable metric algorithm for nonlinear minimax approximation
- Stabilized sequential quadratic programming
- New minimax algorithm
- Nonmonotone line search for minimax problems
- On the entropic regularization method for solving min-max problems with applications
- A quasi-Newton trust-region method
- Nonmonotone trust region method for solving optimization problems
- On the convergence of a new trust region algorithm
- Superlinearly convergent algorithm for min-max problems
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- A new pruning test for finding all global minimizers of nonsmooth functions
- On the global convergence of trust region algorithms for unconstrained minimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Variable metric methods for minimizing a class of nondifferentiable functions
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- An Efficient Method to Solve the Minimax Problem Directly
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- Trust Region Methods
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- Smoothing method for minimax problems
