-
Chapter and Conference Paper
Abstract nonsmooth nonconvex programming
Various approximation results for compositions of locally Lipschitz functions are developed and used to extend known chain rules involving the Michel-Penot subdifferential. These results are combined with exac...
-
Article
A Fritz John optimality condition using the approximate subdifferential
A Fritz John type first-order optimality condition is derived for infinite-dimensional programming problems involving the approximate subdifferential. A discussion of the important properties of the approximat...
-
Article
New Version of the Newton Method for Nonsmooth Equations
In this paper, an inexact Newton scheme is presented which produces a sequence of iterates in which the problem functions are differentiable. It is shown that the use of the inexact Newton scheme does not redu...
-
Article
Increasing Convex-Along-Rays Functions with Applications to Global Optimization
Increasing convex-along-rays functions are defined within an abstract convexity framework. The basic properties of these functions including support sets and subdifferentials are outlined. Applications are pro...
-
Article
Extended Lagrange and Penalty Functions in Optimization
We consider nonlinear Lagrange and penalty functions for optimization problems with a single constraint. The convolution of the objective function and the constraint is accomplished by an increasing positively...