349 results on '"Mangasarian, O. L."'
Search Results
2. Optimization Methods in Massive Data Sets
3. Data Discrimination via Nonlinear Generalized Support Vector Machines
4. OPTIMALITY AND DUALITY IN NONLINEAR PROGRAMMING
5. Machine Learning via Polyhedral Concave Minimization
6. Iterative Solution of Linear Programs
7. Equivalence of the Complementarity Problem to a System of Nonlinear Equations
8. New Error Bounds for the Linear Complementarity Problem
9. Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
10. A Condition Number for Differentiable Convex Inequalities
11. Best Summation Formulae and Discrete Splines
12. Linear and Nonlinear Separation of Patterns by Linear Programming
13. Inequalities for Stochastic Nonlinear Programming Problems
14. Nonlinear Programming Problems with Stochastic Objective Functions
15. Convergent Generalized Monotone Splitting of Matrices
16. Equivalence of Minimal ℓ 0- and ℓ p -Norm Solutions of Linear Equalities, Inequalities and Linear Programs for Sufficiently Small p
17. Privacy-preserving linear programming
18. Uniqueness of integer solution of linear equations
19. Knapsack feasibility as an absolute value equation solvable by successive linear programming
20. A generalized Newton method for absolute value equations
21. Multiple Instance Classification via Successive Linear Programming
22. Absolute value programming
23. Absolute value equation solution via concave minimization
24. Massive Data Classification via Unconstrained Support Vector Machines
25. Convex Kernel Underestimation of Functions with Multiple Local Minima
26. Breast Tumor Susceptibility to Chemotherapy Via Support Vector Machines
27. Nonconvex Piecewise-Quadratic Underestimation for Global Minimization
28. Global Minimization via Piecewise-Linear Underestimation
29. Multicategory Proximal Support Vector Machine Classifiers
30. A Newton Method for Linear Programming
31. Improved Generalization via Tolerant Training
32. Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
33. Hybrid misclassification minimization
34. A class of smoothing functions for nonlinear and mixed complementarity problems
35. Smoothing methods for convex inequalities and linear complementarity problems
36. The linear complementarity problem as a separable bilinear program
37. Misclassification minimization
38. New improved error bounds for the linear complementarity problem
39. Data Discrimination via Nonlinear Generalized Support Vector Machines
40. Bilinear separation of two sets inn-space
41. Error bounds and strong upper semicontinuity for monotone affine variational inequalities
42. Nonlinear complementarity as unconstrained and constrained minimization
43. Minimum principle sufficiency
44. A Feature Selection Newton Method for Support Vector Machine Classification
45. Finite perturbation of convex programs
46. Survival-Time Classification of Breast Cancer Patients
47. Short Notes: Characterizations of Real Matrices of Monotone Kind
48. Equilibrium Points of Bimatrix Games
49. Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
50. Error bounds for nondegenerate monotone linear complementarity problems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.