A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem

DOI10.1080/01630563.2013.873454MaRDI QIDQ4979781zbMATH OpenOpenAlexFDO

Authors Fu-Sheng Wang, Jinbao Jian

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

zbMATH Keywords

linesearch methodminimax problemnonmonotone techniquenonsmooth optimizationSQP algorithm

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47) Methods of successive quadratic programming type (90C55)

Recommendations

• A new non-monotone SQP algorithm for the minimax problem
• scientific article; zbMATH DE number 1014538
• Generalized monotone line search SQP algorithm for constrained minimax problems
• A new superlinearly convergent SQP algorithm for nonlinear minimax problems
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
• An SQP method with a revised non-monotone line search
• A new nonmonotone line search technique for unconstrained optimization
• A new nonmonotone line search technique for unconstrained optimization
• Nonmonotone line search algorithm for constrained minimax problems
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization

Cites work

• A class on nonmonotone stabilization methods in unconstrained optimization
• A compact variable metric algorithm for nonlinear minimax approximation
• A derivative-free nonmonotone line search and its application to the spectral residual method
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• A hybrid algorithm for nonlinear minimax problems
• A new superlinearly convergent SQP algorithm for nonlinear minimax problems
• A nonlinear augmented Lagrangian for constrained minimax problems
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• 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 nonsmooth version of Newton's method
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
• A smooth method for the finite minimax problem
• A successive quadratic programming algorithm with global and superlinear convergence properties
• Algorithms for nonlinear constraints that use lagrangian functions
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• An improved SQP algorithm for solving minimax problems
• An unconstrained optimization method using nonmonotone second order Goldstein's line search
• 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
• New minimax algorithm
• Nonmonotone line search algorithm for constrained minimax problems
• Nonmonotone line search for minimax problems
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• On the nonmonotone line search
• Proximal quasi-Newton methods for nondifferentiable convex optimization
• Superlinearly convergent algorithm for min-max problems
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Trust Region Methods
• Variable metric methods for minimizing a class of nondifferentiable functions

Cited in

(11)

• Nonmonotone line search algorithm for constrained minimax problems
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
• scientific article; zbMATH DE number 5926248 (Why is no real title available?)
• A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
• Generalized monotone line search SQP algorithm for constrained minimax problems
• scientific article; zbMATH DE number 1014538 (Why is no real title available?)
• scientific article; zbMATH DE number 7338817 (Why is no real title available?)
• A new non-monotone SQP algorithm for the minimax problem
• A new QP-free algorithm for nonlinear minimax problems
• A nonmonotone line search for the LBFGS method in parabolic optimal control problems.
• A modified SQP algorithm for minimax problems

This page was built for publication: A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979781)