GlobalView

Rubinov, Alex

Showing items 1 - 15 of 96.

Add to Quick Collection   All 96 Results

Sort:
 Add All Items to Quick Collection
Date: 2010
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60754
Description: This paper examines differences in the choice of similarity measures with respect to their sensitivity to outliers in clustering problems, formulated as mathematical programming problems. Namely, we a... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
Date: 2009
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60722
Description: This article presents a new multidimensional descent method for solving global optimization problems with box-constraints. This is a hybrid method where local search method is used for a local descent... More
Reviewed: Reviewed
Date: 2009
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/40452
Description: GAP functions are useful for solving optimization problems, but the literature contains a variety of different concepts of GAP functions. It is interesting to point out that these concepts have many s... More
Reviewed: Reviewed
Date: 2009
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/41015
Description: We establish new necessary and sufficient optimality conditions for global optimization problems. In particular, we establish tractable optimality conditions for the problems of minimizing a weakly co... More
Reviewed: Reviewed
Date: 2009
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/69501
Description: In this paper we derive necessary and sufficient conditions for some problems of global minimization. Our approach is based on methods of abstract convexity: we use a representation of an upper semico... More
Reviewed: Reviewed
Date: 2009
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/40212
Date: 2009
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/31930
Description: In this article, we continue to study the modified subgradient (MSG) algorithm previously suggested by Gasimov for solving the sharp augmented Lagrangian dual problems. The most important features of ... More
Reviewed: Reviewed
Date: 2008
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/64905
Description: A new measure for network performance evaluation called topology lifetime was introduced in [4, 5]. This measure is based on the notion of unexpected traffic growth and can be used for comparison of t... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
Date: 2008
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/65328
Description: This paper studies the class of increasing and co-radiant (ICR) functions over a cone equipped with an order relation which agrees with the conic structure. In particular, a representation of ICR func... More
Reviewed: Reviewed
Date: 2008
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/58067
Description: Given a set L subset of R-X of functions defined on X, we consider abstract monotone (or, for short, L-monotone) multivalued operators T : X paired right arrows L. We extend the definition of enlargem... More
Reviewed: Reviewed
Date: 2008
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/43546
Description: In this paper, some vector optimization problems are considered where pseudo-ordering relations are determined by nonconvex cones in Banach spaces. We give some characterizations of solution sets for ... More
Reviewed: Reviewed
Date: 2007
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60491
Description: In this paper a constrained optimization problem is transformed into an equivalent one in terms of an auxiliary penalty function. A Lagrange function method is then applied to this transformed problem... More
Reviewed: Reviewed
Date: 2007
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/61647
Description: The ultimate goal of this paper is to demonstrate that abstract convexity provides a natural language and a suitable framework for the examination of zero duality gap properties and exact multipliers ... More
Reviewed: Reviewed
Date: 2007
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/66122
Description: In this article, we use abstract convexity results to study augmented dual problems for (nonconvex) constrained optimization problems. We consider a nonincreasing function f that is lower semicontinuo... More
Reviewed: Reviewed
Date: 2007
Type: Text
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/34012
Description: The present paper investigates the property of a function f : Rn → R+∞ := R U {+∞} with f(0) < +∞ to be Ln-subdifferentiable or Hn-convex. The Ln-subdifferentiability and Hnn-convexity are introduced ... More
Reviewed: Reviewed