A nonmonotonic hybrid algorithm for min-max problem

DOI10.1007/s11081-013-9229-3zbMath1364.90355OpenAlexW1971138901MaRDI QIDQ2357826

Fu-Sheng Wang, Jin-Bao Jian

Publication date: 20 June 2017

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-013-9229-3

zbMATH Keywords

nonsmooth optimizationnonlinear programminghybrid techniquemin-max problemnonmonotonic technique

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nonlinear augmented Lagrangian for constrained minimax problems
• On the accurate identification of active set for constrained minimax problems
• Nonmonotone algorithm for minimax optimization problems
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• On a subproblem of trust region algorithms for constrained optimization
• An improved SQP algorithm for solving minimax problems
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
• Nonmonotonic trust region algorithm
• Nonmonotone line search for minimax problems
• Nonmonotone line search algorithm for constrained minimax problems
• A hybrid algorithm for nonlinear minimax problems
• Superlinearly convergent algorithm for min-max problems
• An unconstrained optimization method using nonmonotone second order Goldstein's line search
• 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
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
• Generalized monotone line search SQP algorithm for constrained minimax 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
• Trust Region Methods
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• On the nonmonotone line search

This page was built for publication: A nonmonotonic hybrid algorithm for min-max problem