A new objective penalty function approach for solving constrained minimax problems
From MaRDI portal
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
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 16320 (Why is no real title available?)
- scientific article; zbMATH DE number 51950 (Why is no real title available?)
- scientific article; zbMATH DE number 2032319 (Why is no real title available?)
- A hybrid algorithm for nonlinear minimax problems
- A new algorithm for solving constrained optimization on exact penalty with two parameters
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- A smooth method for the finite minimax problem
- A smoothing trust-region Newton-CG method for minimax problem
- A smoothing-out technique for min—max optimization
- Algorithms with adaptive smoothing for finite minimax problems
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- An Efficient Method to Solve the Minimax Problem Directly
- An improved SQP algorithm for solving minimax problems
- An interior-point algorithm for nonlinear minimax problems
- An objective penalty function method for nonlinear programming.
- Calmness and Exact Penalization
- Exactness and algorithm of an objective penalty function
- Hyperbolic smoothing function method for minimax problems
- Minimax and applications
- New algorithms for constrained minimax optimization
- New exact penalty function for solving constrained finite min-max problems
- New minimax algorithm
- Nonlinear Programming
- Nonmonotone line search for minimax problems
- On the entropic regularization method for solving min-max problems with applications
- Optimization by Least Squares
- Smoothing method for minimax problems
Cited in
(9)- Two Classes of Smooth Objective Penalty Functions for Constrained Problems
- A filled penalty function method for solving constrained optimization problems
- Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
- An objective penalty function-based method for inequality constrained minimization problem
- New exact penalty function for solving constrained finite min-max problems
- An M-objective penalty function algorithm under big penalty parameters
- scientific article; zbMATH DE number 6747041 (Why is no real title available?)
- An approach to solve local and global optimization problems based on exact objective filled penalty functions
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
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)
