Mangasarian O.L.

O.L. Mangasarian

Information about the author O.L. Mangasarian will soon be added to the site.
Found 23 papers in total
Absolute value programming
Absolute value programming
2007
We investigate equations, inequalities and mathematical programs involving absolute...
Breast tumor susceptibility to chemotherapy via support vector machines
Breast tumor susceptibility to chemotherapy via support vector machines
2006
Support vector machine (SVM) classification together with alternative DNA splicing...
Convex kernel underestimation of functions with multiple local minima
Convex kernel underestimation of functions with multiple local minima
2006
A function on R n with multiple local minima is approximated from below, via linear...
Nonconvex piecewise-quadratic underestimation for global minimization
Nonconvex piecewise-quadratic underestimation for global minimization
2006
Motivated by the fact that important real-life problems, such as the protein docking...
A Newton method for linear programming
A Newton method for linear programming
2004
A fast Newton method is proposed for solving linear programs with a very large...
A linearly convergent derivative-free descent method for strongly monotone complementarity problems
A linearly convergent derivative-free descent method for strongly monotone complementarity problems
1999
We establish the first rate of convergence result for the class of derivative-free...
Arbitrary-norm separating plane
Arbitrary-norm separating plane
1999
A plane separating two point sets in n -dimensional real space is constructed such...
Parsimonious least norm approximation
Parsimonious least norm approximation
1998
A theoretically justifiable fast finite successive linear approximation algorithm is...
Mathematical programming for data mining: Formulations and challenges
Mathematical programming for data mining: Formulations and challenges
1999
This article is intended to serve as an overview of a rapidly emerging research and...
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
1998
A global error bound is given on the distance between an arbitrary point in the n...
Feature selection via mathematical programming
Feature selection via mathematical programming
1998
The problem of discriminating between two finite point sets in n -dimensional feature...
A class of smoothing functions for nonlinear and mixed complementarity problems
A class of smoothing functions for nonlinear and mixed complementarity problems
1996
We propose a class of parametric smooth functions that approximate the fundamental...
Smoothing methods for convex inequalities and linear complementarity problems
Smoothing methods for convex inequalities and linear complementarity problems
1995
A smooth approximation to the plus function is obtained by integratng the sigmoid...
New improved error bounds for the linear complementarity problem
New improved error bounds for the linear complementarity problem
1994
New local and global error bounds are given for both nonmonotone and monotone linear...
Nonlinear complementarity as unconstrained and constrained minimization
Nonlinear complementarity as unconstrained and constrained minimization
1993
The nonlinear complementarity problem is cast as an unconstrained minimization problem...
Error bounds for inconsistent linear inequalities and programs
Error bounds for inconsistent linear inequalities and programs
1994
For any system of linear inequalities, consistent or not, the norm of the violations...
New error bounds for the linear complementarity problem
New error bounds for the linear complementarity problem
1994
Recently Mangasarian and Solodov showed that every nonlinear complementarity problem...
Error bounds and strong upper semicontinuity for monotone affine variational inequalities
Error bounds and strong upper semicontinuity for monotone affine variational inequalities
1993
Global error bounds for possibly degenerate or nondegenerate monotone affine...
Minimum Principle Sufficiency
Minimum Principle Sufficiency
1992
The authors characterize the property of obtaining a solution to a convex program by...
Error bounds for nondegenerate monotone linear complementarity problems
Error bounds for nondegenerate monotone linear complementarity problems
1990
Error bounds and upper Lipschitz continuity results are given for monotone linear...
Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
1990
Convergence is established for the multi-sweep asynchronous parallel successive...
Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
1988
A gradient projection successive overrelaxation (GP-SOR) algorithm is proposed for the...
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
1988
Convergence is established for asynchronous parallel successive overrelaxation (SOR)...
Papers per page: