Skip to main content

and
  1. No Access

    Article

    A generalized Farkas lemma with applications to quasidifferentiable programming

    For sublinear map**s between normed linear spaces a generalization of Farkas' lemma is established thus extending the known results to include a class of non-linear functions. A generalized Motzkin alternati...

    B. M. Glover in Zeitschrift für Operations Research (1982)

  2. No Access

    Article

    A Farkas lemma for difference sublinear systems and quasidifferentiable programming

    A new generalized Farkas theorem of the alternative is presented for systems involving functions which can be expressed as the difference of sublinear functions. Various other forms of theorems of the alternat...

    B. M. Glover, V. Jeyakumar, W. Oettli in Mathematical Programming (1994)

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

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

  5. No Access

    Article

    Generalized convex relations with applications to optimization and models of economic dynamics

    We examine a notion of generalized convex set-valued map**, extending the notions of a convex relation and a convex process. Under general conditions, we establish duality results for composite set-valued ma...

    A. M. Rubinov, V. Jeyakumar, B. M. Glover in Set-Valued Analysis (1996)

  6. No Access

    Article

    Characterizing global optimality for DC optimization problems under convex inequality constraints

    Characterizations of global optimality are given for general difference convex (DC) optimization problems involving convex inequality constraints. These results are obtained in terms of ε-subdifferentials of t...

    V. Jeyakumar, B. M. Glover in Journal of Global Optimization (1996)

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

  8. No Access

    Chapter

    Quasiconvexity via Two Step Functions

    Quasiconvex functions are here defined and studied using a representation of these functions as generalized convex functions with respect to special classes of quasiaffine two step functions. Some of the main ...

    A. M. Rubinov, B. M. Glover in Generalized Convexity, Generalized Monoton… (1998)

  9. No Access

    Article

    Dual conditions characterizing optimality for convex multi-objective programs

    B.M. Glover, V. Jeyakumar, A.M. Rubinov in Mathematical Programming (1999)

  10. No Access

    Chapter

    Approximations to the Clarke Generalized Jacobians and Nonsmooth Least-Squares Minimization

    Here we use a uniform approximation to the Clarke generalized Jacobian to design an algorithm for solving a class of nonsmooth least-squares minimization problems:

    H. Xu, A. M. Rubinov, B. M. Glover in Progress in Optimization (1999)

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

  12. No Access

    Chapter

    Nonlinear Unconstrained Optimization Methods: A Review

    In this review paper, we report recent results in the study of nonlinear unconstrained optimization methods, such as nonlinear penalty function method and nonlinear Lagrangian method. One important feature of ...

    A. M. Rubinov, X. Q. Yang, B. M. Glover in Progress in Optimization (2000)

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

  14. No Access

    Chapter and Conference Paper

    Predicting Successful Transthoracic Cardioversion by Dominant Atrial Fibrillatory Frequency Analysis: The Effects of Bisoprolol

    The most common strategies in the management of atrial fibrillation (AF) involve electrical cardioversion and pharmacological agents. Bisoprolol is a high selective β1 adrenoceptor blocker used for ventricular...

    J. D. Diaz, O. J. Escalona, N. C. Castro in World Congress on Medical Physics and Biom… (2009)

  15. No Access

    Article

    Investigation of a multimarker approach to the initial assessment of patients with acute chest pain

    Early identification of acute coronary syndrome (ACS) is important to guide therapy at a time when it is most likely to be of value. In addition, predicting future risk helps identify those most likely to bene...

    C. J. McCann, B. M. Glover, I. B. A. Menown, M. J. Moore, J. McEneny in Advances in Therapy (2009)