In this paper, we propose an alternating proximal gradient method that solves convex minimization problems with three or more separable blocks in the objective function. Our method is based on the framework of alternating direction method of multipliers. The main computational effort in each iteration of the proposed method is to compute the proximal mappings of the involved convex functions. T...

27 information is used. A choice then has to be made as to which is the most eecient option. Acknowledgments. We are grateful to the referees for their useful comments. We thank Robert Michael Lewis for his valuable suggestions on how best to present this material, particularly the results given in x7. Mathematical models for the predictive value of early CA125 serum levels in epithelial ovaria...

This paper contributes to the solution of the minimization problem of Ordered Binary Decision Diagrams by means of variable reordering. We suggest a new heuristic that is based on sampling. A small OBDD sample is chosen from the OBDDs that are considered for minimization. Solving the problem for this small sample, we obtain a variable order that is adapt for the entire OBDDs. We present rst exp...

Rhinoplasty is one of the most complicated aesthetic surgeries. One important factor in nasal profile analysis before surgery is the NTP (Nasal Tip Projection). There has been controversy over defining the best tip projection and due to cultural differences there is a need to find the best formulation for Iranian noses. We selected 50 randomized patients. Lateral nasal views were captured from ...

The Stability Index Method (SIM) combines stochastic and deterministic algorithms to find global minima of multidimensional functions. The functions may be nonsmooth and may have multiple local minima. The method examines the change of the diameters of the minimizing sets for its stopping criterion. At first, the algorithm uses the uniform random distribution in the admissible set. Then normal ...

An iterative method for the minimization of convex functions f : R → R, called a Newton Bracketing (NB) method, is presented. The NB method proceeds by using Newton iterations to improve upper and lower bounds on the minimum value. The NB method is valid for n = 1, and in some cases for n > 1 (sufficient conditions given here). The NB method is applied to large scale Fermat–Weber location probl...

Some promising ideas for minimizing a nonlinear function, whose first and second derivatives are given, by a modified Newton method, were introduced by Fiacco and McCormick (Ref. 1). Unfortunately, in developing a method around these ideas, Fiacco and McCormick used a potentially unstable, or even impossible, matrix factorization. Using some recently developed techniques for factorizing an inde...

A mobile station (MS) undergoes handoff when it travels out of the coverage area of its current access point (AP) and tries to associate with another AP. In this paper we propose a method using GPS (Global Positioning System) to minimize the number of APs to be scanned by the MS during each handoff procedure. The entire geographical area is considered as a two dimensional plane divided into hex...