A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
From MaRDI portal
Publication:4979781
DOI10.1080/01630563.2013.873454zbMath1291.90304OpenAlexW2088749903MaRDI QIDQ4979781
Publication date: 19 June 2014
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2013.873454
Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35) Methods of successive quadratic programming type (90C55)
Related Items (2)
A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints ⋮ A nonmonotone line search for the LBFGS method in parabolic optimal control problems
Cites Work
- A nonlinear augmented Lagrangian for constrained minimax problems
- A smooth method for the finite minimax problem
- An improved SQP algorithm for solving minimax problems
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- A compact variable metric algorithm for nonlinear minimax approximation
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- New minimax algorithm
- Nonmonotone line search for minimax problems
- Nonmonotone line search algorithm for constrained minimax problems
- A hybrid algorithm for nonlinear minimax problems
- A class on nonmonotone stabilization methods in unconstrained optimization
- Superlinearly convergent algorithm for min-max problems
- A nonsmooth version of Newton's method
- 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
- A successive quadratic programming algorithm with global and superlinear convergence properties
- Variable metric methods for minimizing a class of nondifferentiable functions
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Algorithms for nonlinear constraints that use lagrangian functions
- Trust Region Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- A derivative-free nonmonotone line search and its application to the spectral residual method
- On the nonmonotone line search
This page was built for publication: A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
