A note on solving nonlinear minimax problems via a differentiable penalty function
The note demonstrates that modelling a nonlinear minimax problem as a nonlinear programming problem and applying a classical differentiable penalty function to attempt to solve the problem can lead to convergence to a stationary point of the penalty function which is not a feasible point of the nonlinear programming problem. This occured naturally in an application from statistical reliability theory. The note resolves the problem through modification of both the problem formulation and the iterative penalty function method.
- On solving three classes of nonlinear programming problems via simple differentiable penalty functions
- A smooth method for the finite minimax problem
- A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
- scientific article; zbMATH DE number 4010220
- On penalty methods for minimax problems
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- An Algorithm for the Chebyshev Problem—With an Application to Concave Programming
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- scientific article; zbMATH DE number 3390139 (Why is no real title available?)
- Maximum Likelihood Estimation for Distributions with Monotone Failure Rate
- Maximum Likelihood Estimation of Life-Distributions from Renewal Testing
- Second-order conditions for an exact penalty function
- The Minimum Distance Method
This page was built for publication: A note on solving nonlinear minimax problems via a differentiable penalty function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795737)