A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming

DOI10.1016/J.AMC.2009.05.009MaRDI QIDQ732375zbMATH OpenOpenAlexFDO

Authors Qian Zhou, Yigui Ou

Publication date 9 October 2009

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2009.05.009

zbMATH Keywords

numerical examplesglobal convergencenonsmooth optimizationsemi-infinite programmingtrust region algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51) Semi-infinite programming (90C34)

Recommendations

• scientific article; zbMATH DE number 1145226
• A class of nonmonotone trust region algorithms for constrained optimizations
• A class of nonmonotone trust region algorithms for unconstrained optimization problems
• scientific article; zbMATH DE number 5951375
• A nonmonotone trust region algorithm for unconstrained nonsmooth optimization
• scientific article; zbMATH DE number 2217610
• A trust region method for semi-infinite programming problems
• scientific article; zbMATH DE number 1932418
• A nonmonotonic trust region method for constrained optimization problems
• scientific article; zbMATH DE number 1940910

Cites work

• scientific article; zbMATH DE number 50640 (Why is no real title available?)
• scientific article; zbMATH DE number 1275849 (Why is no real title available?)
• scientific article; zbMATH DE number 1940910 (Why is no real title available?)
• A Nonmonotone Line Search Technique for Newton’s Method
• An implementation of a discretization method for semi-infinite programming
• An unconstrained optimization method using nonmonotone second order Goldstein's line search
• Nonmonotone adaptive trust-region method for unconstrained optimization problems
• Nonmonotone trust region method for solving optimization problems
• On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
• Optimization theory and methods. Nonlinear programming
• Optimization. Algorithms and consistent approximations
• Sufficient conditions for extremum, penalty functions and regularity

Cited in

(9)

• A new trust-region algorithm for finite minimax problems
• A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
• A nonmonotone supermemory gradient algorithm for unconstrained optimization
• A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
• Global convergence of a semi-infinite optimization method
• A non-monotone SQP algorithm with L-BFGS update for solving semi-infinite minimax problem based on active set technique
• A modified ODE-based algorithm for unconstrained optimization problems
• A spline smoothing Newton method for semi-infinite minimax problems
• A memory gradient method based on the nonmonotone technique

This page was built for publication: A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming

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