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

DOI10.1016/j.amc.2009.05.009zbMath1180.65080OpenAlexW1967831733MaRDI QIDQ732375

Qian Zhou, Yi-gui 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

global convergencenonsmooth optimizationnumerical examplessemi-infinite programmingtrust region algorithm

Mathematics Subject Classification ID

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

Related Items (6)

A memory gradient method based on the nonmonotone technique ⋮ A modified ODE-based algorithm for unconstrained optimization problems ⋮ A trust-region method for unconstrained multiobjective problems with applications in satisficing processes ⋮ A nonmonotone supermemory gradient algorithm for unconstrained optimization ⋮ A spline smoothing Newton method for semi-infinite minimax problems ⋮ A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization

Cites Work

• Optimization. Algorithms and consistent approximations
• Nonmonotone adaptive trust-region method for unconstrained optimization problems
• Nonmonotone trust region method for solving optimization problems
• An unconstrained optimization method using nonmonotone second order Goldstein's line search
• Optimization theory and methods. Nonlinear programming
• An implementation of a discretization method for semi-infinite programming
• On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
• A Nonmonotone Line Search Technique for Newton’s Method
• Sufficient conditions for extremum, penalty functions and regularity
• Unnamed Item
• Unnamed Item
• Unnamed Item

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