An Algorithm for Some Special Nondifferentiable Optimization Problems

Published Online:https://doi.org/10.1287/opre.25.5.808

We present an algorithm for a special class of nonlinear optimization problems with a nondifferentiable objective function and prove its convergence. The method does not use the notion of subgradient and no convexity assumption is made. We discuss the application of the method to an exact penalty function and to an environmental noise-management problem.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.