A new objective penalty function approach for solving constrained minimax problems

DOI10.1007/s40305-014-0041-3zbMath1331.90097OpenAlexW2013317380MaRDI QIDQ489101

Qiang Long, Jueyou Li, Zhi-You Wu

Publication date: 27 January 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-014-0041-3

zbMATH Keywords

minimax problemapproximate solutionconstrained minimizationobjective penalty function

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Related Items (5)

An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems ⋮ An approach to solve local and global optimization problems based on exact objective filled penalty functions ⋮ An objective penalty function-based method for inequality constrained minimization problem ⋮ Two Classes of Smooth Objective Penalty Functions for Constrained Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms with adaptive smoothing for finite minimax problems
• A smooth method for the finite minimax problem
• New exact penalty function for solving constrained finite min-max problems
• A smoothing trust-region Newton-CG method for minimax problem
• An interior-point algorithm for nonlinear minimax problems
• An improved SQP algorithm for solving minimax problems
• New minimax algorithm
• Nonmonotone line search for minimax problems
• On the entropic regularization method for solving min-max problems with applications
• An objective penalty function method for nonlinear programming.
• Minimax and applications
• A hybrid algorithm for nonlinear minimax problems
• A penalty function algorithm with objective parameters for nonlinear mathematical programming
• Exactness and algorithm of an objective penalty function
• Hyperbolic smoothing function method for minimax problems
• Calmness and Exact Penalization
• A smoothing-out technique for min—max optimization
• New algorithms for constrained minimax optimization
• An Efficient Method to Solve the Minimax Problem Directly
• An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
• Nonlinear Programming
• Optimization by Least Squares
• Smoothing method for minimax problems

This page was built for publication: A new objective penalty function approach for solving constrained minimax problems