MP
2011
13 years 3 months ago
2011
MP
2011
13 years 3 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
MP
2011
13 years 3 months ago
2011
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
MP
2011
13 years 3 months ago
2011
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
MP
2011
13 years 7 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
MP
2011
13 years 7 months ago
2011
MP
2011
13 years 7 months ago
2011
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
MP
2011
13 years 7 months ago
2011
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
MP
2011
13 years 7 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...