Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Clustering And Multifacility Location With Constraints Via Distance Function Penalty Methods And Dc Programming, Mau Nam Nguyen, Thai An Nguyen, Sam Reynolds, Tuyen Tran
Clustering And Multifacility Location With Constraints Via Distance Function Penalty Methods And Dc Programming, Mau Nam Nguyen, Thai An Nguyen, Sam Reynolds, Tuyen Tran
Mathematics and Statistics Faculty Publications and Presentations
This paper is a continuation of our effort in using mathematical optimization involving DC programming in clustering and multifacility location. We study a penalty method based on distance functions and apply it particularly to a number of problems in clustering and multifacility location in which the centers to be found must lie in some given set constraints. We also provide different numerical examples to test our method.
Variational Geometric Approach To Generalized Differential And Conjugate Calculi In Convex Analysis, Boris S. Mordukhovich, Nguyen Mau Nam, R. Blake Rector, T. Tran
Variational Geometric Approach To Generalized Differential And Conjugate Calculi In Convex Analysis, Boris S. Mordukhovich, Nguyen Mau Nam, R. Blake Rector, T. Tran
Mathematics and Statistics Faculty Publications and Presentations
This paper develops a geometric approach of variational analysis for the case of convex objects considered in locally convex topological spaces and also in Banach space settings. Besides deriving in this way new results of convex calculus, we present an overview of some known achievements with their unified and simplified proofs based on the developed geometric variational schemes. Key words. Convex and variational analysis, Fenchel conjugates, normals and subgradients, coderivatives, convex calculus, optimal value functions.
Subgradients Of Minimal Time Functions Without Calmness, Nguyen Mau Nam, Dang Van Cuong
Subgradients Of Minimal Time Functions Without Calmness, Nguyen Mau Nam, Dang Van Cuong
Mathematics and Statistics Faculty Publications and Presentations
In recent years there has been great interest in variational analysis of a class of nonsmooth functions called the minimal time function. In this paper we continue this line of research by providing new results on generalized differentiation of this class of functions, relaxing assumptions imposed on the functions and sets involved for the results. In particular, we focus on the singular subdifferential and the limiting subdifferential of this class of functions.
Nesterov's Smoothing Technique And Minimizing Differences Of Convex Functions For Hierarchical Clustering, Mau Nam Nguyen, Wondi Geremew, Sam Raynolds, Tuyen Tran
Nesterov's Smoothing Technique And Minimizing Differences Of Convex Functions For Hierarchical Clustering, Mau Nam Nguyen, Wondi Geremew, Sam Raynolds, Tuyen Tran
Mathematics and Statistics Faculty Publications and Presentations
A bilevel hierarchical clustering model is commonly used in designing optimal multicast networks. In this paper we will consider two different formulations of the bilevel hierarchical clustering problem -- a discrete optimization problem which can be shown to be NP-hard. Our approach is to reformulate the problem as a continuous optimization problem by making some relaxations on the discreteness conditions. This approach was considered by other researchers earlier, but their proposed methods depend on the square of the Euclidian norm because of its differentiability. By applying the Nesterov smoothing technique and the DCA -- a numerical algorithm for minimizing differences …
Nonsmooth Algorithms And Nesterov's Smoothing Technique For Generalized Fermat-Torricelli Problems, Nguyen Mau Nam, Nguyen Thai An, R. Blake Rector, Jie Sun
Nonsmooth Algorithms And Nesterov's Smoothing Technique For Generalized Fermat-Torricelli Problems, Nguyen Mau Nam, Nguyen Thai An, R. Blake Rector, Jie Sun
Mathematics and Statistics Faculty Publications and Presentations
We present algorithms for solving a number of new models of facility location which generalize the classical Fermat--Torricelli problem. Our first approach involves using Nesterov's smoothing technique and the minimization majorization principle to build smooth approximations that are convenient for applying smooth optimization schemes. Another approach uses subgradient-type algorithms to cope directly with the nondifferentiability of the cost functions. Convergence results of the algorithms are proved and numerical tests are presented to show the effectiveness of the proposed algorithms.
The Derivation Of Hybridizable Discontinuous Galerkin Methods For Stokes Flow, Bernardo Cockburn, Jay Gopalakrishnan
The Derivation Of Hybridizable Discontinuous Galerkin Methods For Stokes Flow, Bernardo Cockburn, Jay Gopalakrishnan
Mathematics and Statistics Faculty Publications and Presentations
In this paper, we introduce a new class of discontinuous Galerkin methods for the Stokes equations. The main feature of these methods is that they can be implemented in an efficient way through a hybridization procedure which reduces the globally coupled unknowns to certain approximations on the element boundaries. We present four ways of hybridizing the methods, which differ by the choice of the globally coupled unknowns. Classical methods for the Stokes equations can be thought of as limiting cases of these new methods.