Feebly associativeP-hypergroupoids

In this paper we study the hyperstructures, saidP-hypergroupoids, (H, P*) in whichH is a set andP* is one of the hyperoperations defined as follows: ?(x, y) εH ²,xP*y=xyP orxP*y=Pxy whereP is a subset ofH. In particular we give a general formula for to express the simple hyperproducts ofn elements and then we consider some cases in which (H, P*) is feebly associative. We study, in such cases theβ-relations.     

Nonlinear stability of incoherence and collective synchronization in a population of coupled oscillators

A mean-field model of nonlinearly coupled oscillators with randomly distributed frequencies and subject to independent external white noises is analyzed in the thermodynamic limit. When the frequency distribution isbimodal, new results include subcritical spontaneous stationary synchronization of the oscillators, supercritical time-periodic synchronization, bistability, and hysteretic phenomena. Bifurcating synchronized states are asymptotically constructed near bifurcation values of the coupling strength, and theirnonlinear stability properties ascertained.     

Reformulation of the support set selection problem in the logical analysis of data

The paper is concerned with the problem of binary classification of data records, given an already classified training set of records. Among the various approaches to the problem, the methodology of the logical analysis of data (LAD) is considered. Such approach is based on discrete mathematics, with special emphasis on Boolean functions. With respect to the standard LAD procedure, enhancements based on probability considerations are presented. In particular, the problem of the selection of the optimal support set is formulated as a weighted set covering problem. Testable statistical hypothesis are used. Accuracy of the modified LAD procedure is compared to that of the standard LAD procedure on datasets of the UCI repository. Encouraging results are obtained and discussed.     

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

 In this paper, we present a nonlinear programming algorithm for solving semidefinite programs (SDPs) in standard form. The algorithm's distinguishing feature is a change of variables that replaces the symmetric, positive semidefinite variable X of the SDP with a rectangular variable R according to the factorization X=RR ^T . The rank of the factorization, i.e., the number of columns of R, is chosen minimally so as to enhance computational speed while maintaining equivalence with the SDP. Fundamental results concerning the convergence of the algorithm are derived, and encouraging computational results on some large-scale test problems are also presented. Received: March 22, 2001 / Accepted: August 30, 2002 Published online: December 9, 2002 Key Words. semidefinite programming – low-rank factorization – nonlinear programming – augmented Lagrangian – limited memory BFGS This research was supported in part by the National Science Foundation under grants CCR-9902010, INT-9910084, CCR-0203426 and CCR-0203113     

Iteration-complexity of first-order penalty methods for convex programming

This paper considers a special but broad class of convex programming problems whose feasible region is a simple compact convex set intersected with the inverse image of a closed convex cone under an affine transformation. It studies the computational complexity of quadratic penalty based methods for solving the above class of problems. An iteration of these methods, which is simply an iteration of Nesterov’s optimal method (or one of its variants) for approximately solving a smooth penalization subproblem, consists of one or two projections onto the simple convex set. Iteration-complexity bounds expressed in terms of the latter type of iterations are derived for two quadratic penalty based variants, namely: one which applies the quadratic penalty method directly to the original problem and another one which applies the latter method to a perturbation of the original problem obtained by adding a small quadratic term to its objective function.     

Optimal promotion planning—depth and frequency—for a two-stage supply chain under Markov switching demand

In considering the retailer–supplier supply chain, this paper analyzes how a retailer reasonably decides both the depth and frequency of the price discount promotion including or excluding a supplier’s inventory decision. Assuming that the promotion frequency used by the retailer is probabilistic, we model a promotion-inventory decision under an AR(1) demand with a Markov switching promotion regime. After obtaining the optimal promotion plan, our analysis also considers the behavior of the optimal promotion decision; the retailer’s price format selection, either an Every-Day-Low-Price policy (EDLP) or a Promotion policy (HiLo); and the impact of information sharing of promotion status on the system’s performance. Our results suggest that a retailer tends to overpromote if inventory cost is excluded in its promotion decision, that increasing the market share is a preferable action for both the retailer and the supplier, that total margin and price-elasticity play an important role in selecting the price format, and that the profitability for a supplier of sharing promotion information depends on the transition probabilities of the Markov switching regime.     

A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms

The main goals of this paper are to: i) relate two iteration-complexity bounds derived for the Mizuno-Todd-Ye predictor-corrector (MTY P-C) algorithm for linear programming (LP), and; ii) study the geometrical structure of the LP central path. The first iteration-complexity bound for the MTY P-C algorithm considered in this paper is expressed in terms of the integral of a certain curvature function over the traversed portion of the central path. The second iteration-complexity bound, derived recently by the authors using the notion of crossover events introduced by Vavasis and Ye, is expressed in terms of a scale-invariant condition number associated with m × n constraint matrix of the LP. In this paper, we establish a relationship between these bounds by showing that the first one can be majorized by the second one. We also establish a geometric result about the central path which gives a rigorous justification based on the curvature of the central path of a claim made by Vavasis and Ye, in view of the behavior of their layered least squares path following LP method, that the central path consists of long but straight continuous parts while the remaining curved part is relatively “short”. R. D. C. Monteiro was supported in part by NSF Grants CCR-0203113 and CCF-0430644 and ONR grant N00014-05-1-0183. T. Tsuchiya was supported in part by Japan-US Joint Research Projects of Japan Society for the Promotion of Science “Algorithms for linear programs over symmetric cones” and the Grants-in-Aid for Scientific Research (C) 15510144 of Japan Society for the Promotion of Science.