Search
Now showing items 1-10 of 17
Solution of General Linear Complemetarity Problems via nondifferentiable Concave Minimization
(1996)
Finite termination, at point satisfying the minimum principle necessary optimality condition, is established for a stepless (no line search) successive linearization algorithm (SLA) for minimizing a nondifferentiable concave ...
Parsimonious Least Norm Approximation
(1997)
A theoretically justifiable fast finite successive linear approximation algorithm is proposed for obtaining a parsimonious solution to a corrupted linear system Ax=b+p, where the corruption p is due to noise or error in ...
Arbitrary-Norm Separating Plane
(1997)
A plane separating two point sets in n-dimensional real space is constructed such that it minimized the sum of arbitrary-norm distances of misclassified points to the plane. In contrast the previous approaches used surrogates ...
Minimum-Support Solutions of Polyhedral Concave Programs
(1997)
Motivated by the successful application of mathematical programming techniques to difficult machine learning problems, we seek solutions of concave minimization problems over polyhedral sets with a minimum number of nonzero ...
Feature Selection via Mathematic Programming
(1997-04)
The problem of discriminating between two finite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a mathematical program with a parametric ...
Regularized Linear Programs with Equilibrium Constraints
(1997)
We consider an arbitrary linear program with equilibrium constrains (LPEC) that may possibly be infeasible or have an unbounded objective function. We regularize the LPEC by perturbing it in a minimal way so that the ...
Mathematical Programming for Data Mining: Formulations and Challenges
(1998)
This paper is intended to serve as an overview of a rapidly emerging research and applications area. in addition to providing a general overview, motivating the importance of data mining problems within the area of knowledge ...
Mathematical Programming in Data Mining
(1996)
Mathematical programming approaches to three fundamental problems will b described: feature selection clustering and robust representation. The feature selection problem considered is that of discriminating between two ...
Individual and Collective Prognostic Prediction
(1996-01-04)
The prediction of survival time or recurrence time is an important learning problem in medical domains. The Recurrence Surface Approximation (RSA) method is a natural, effective method for predicting recurrence times using ...
Exact Penalty Functions for Mathematical Programs with Linear Complementarity Constraints
(1996)
We establish a new general exact penalty function result for a constrained optimization problem and apply this result to a mathematical program with linear complementarity constraints.