Skip to main content

and
  1. No Access

    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...

    B. M. Glover, V. Jeyakumar in Generalized Convexity (1994)

  2. No Access

    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...

    B. M. Glover, B. D. Craven in Journal of Optimization Theory and Applications (1994)

  3. No Access

    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...

    H. Xu, B. M. Glover in Journal of Optimization Theory and Applications (1997)

  4. No Access

    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...

    A. M. Rubinov, B. M. Glover in Journal of Optimization Theory and Applications (1999)

  5. No Access

    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...

    A. M. Rubinov, X. Q. Yang, B. M. Glover in Journal of Optimization Theory and Applications (2001)