A new objective penalty function approach for solving constrained minimax problems
From MaRDI portal
Publication:489101
DOI10.1007/S40305-014-0041-3zbMATH Open1331.90097OpenAlexW2013317380MaRDI QIDQ489101FDOQ489101
Authors: Jueyou Li, Qiang Long, Zhiyou 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
Recommendations
- New exact penalty function for solving constrained finite min-max problems
- An objective penalty function method for nonlinear programming.
- An objective penalty function-based method for inequality constrained minimization problem
- scientific article; zbMATH DE number 6747041
- Constrained global optimization using a new exact penalty function
Cites Work
- Nonlinear Programming
- An objective penalty function method for nonlinear programming.
- Minimax and applications
- Exactness and algorithm of an objective penalty function
- Calmness and Exact Penalization
- Title not available (Why is that?)
- Optimization by Least Squares
- Algorithms with adaptive smoothing for finite minimax problems
- New exact penalty function for solving constrained finite min-max problems
- Nonmonotone line search for minimax problems
- Hyperbolic smoothing function method for minimax problems
- A smoothing-out technique for min—max optimization
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- Smoothing method for minimax problems
- Title not available (Why is that?)
- An improved SQP algorithm for solving minimax problems
- New minimax algorithm
- A hybrid algorithm for nonlinear minimax problems
- An Efficient Method to Solve the Minimax Problem Directly
- A smooth method for the finite minimax problem
- A smoothing trust-region Newton-CG method for minimax problem
- An interior-point algorithm for nonlinear minimax problems
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- On the entropic regularization method for solving min-max problems with applications
- A new algorithm for solving constrained optimization on exact penalty with two parameters
- Title not available (Why is that?)
- New algorithms for constrained minimax optimization
- Title not available (Why is that?)
Cited In (8)
- Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- A filled penalty function method for solving constrained optimization problems
- Title not available (Why is that?)
- An M-objective penalty function algorithm under big penalty parameters
- 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
This page was built for publication: A new objective penalty function approach for solving constrained minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489101)
