The following pages link to Olvi L. Mangasarian (Q398652):
Displaying 50 items.
- (Q210404) (redirect page) (← links)
- Unsupervised and semisupervised classification via absolute value inequalities (Q274091) (← links)
- Absolute value equation solution via linear programming (Q398653) (← links)
- A hybrid algorithm for solving the absolute value equation (Q499704) (← links)
- Least-norm linear programming solution as an unconstrained minimization problem (Q593978) (← links)
- Uniqueness of integer solution of linear equations (Q601980) (← links)
- Privacy-preserving linear programming (Q628663) (← links)
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\) (Q650241) (← links)
- Privacy-preserving horizontally partitioned linear programs (Q691376) (← links)
- Primal-dual bilinear programming solution of the absolute value equation (Q694190) (← links)
- A Newton method for linear programming (Q704747) (← links)
- Error bounds for nondegenerate monotone linear complementarity problems (Q753691) (← links)
- Conjugate cone characterization of positive definite and semidefinite matrices (Q787230) (← links)
- Finite perturbation of convex programs (Q810372) (← links)
- Absolute value equations (Q865400) (← links)
- Absolute value programming (Q885823) (← links)
- Multiple instance classification via successive linear programming (Q933822) (← links)
- A generalized Newton method for absolute value equations (Q1001330) (← links)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
- Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs (Q1058992) (← links)
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs (Q1078096) (← links)
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming (Q1085068) (← links)
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs (Q1103527) (← links)
- A simple characterization of solutions sets of convex programs (Q1108196) (← links)
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem (Q1116899) (← links)
- Optimal simplex tableau characterization of unique and bounded solutions of linear programs (Q1142157) (← links)
- A stable theorem of the alternative: An extension of the Gordan theorem (Q1166412) (← links)
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs (Q1195287) (← links)
- Global error bounds for monotone affine variational inequality problems (Q1195343) (← links)
- Minimum principle sufficiency (Q1198327) (← links)
- Logarithmic convexity and geometric programming (Q1215458) (← links)
- Solution of symmetric linear complementarity problems by iterative methods (Q1231762) (← links)
- Uniqueness of solution in linear programming (Q1254945) (← links)
- Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification (Q1290659) (← links)
- A linearly convergent derivative-free descent method for strongly monotone complementarity problems (Q1303775) (← links)
- Arbitrary-norm separating plane (Q1306363) (← links)
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities (Q1312768) (← links)
- Bilinear separation of two sets in \(n\)-space (Q1315445) (← links)
- Nonlinear complementarity as unconstrained and constrained minimization (Q1321650) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- Misclassification minimization (Q1342895) (← links)
- Solution of general linear complementarity problems via nondifferentiable concave minimization (Q1384433) (← links)
- Improved generalization via tolerant training (Q1389076) (← links)
- \(k\)-plane clustering (Q1579945) (← links)
- Sufficient conditions for the unsolvability and solvability of the absolute value equation (Q1676495) (← links)
- The linear complementarity problem as a separable bilinear program (Q1804582) (← links)
- Set containment characterization (Q1810880) (← links)
- Survival-time classification of breast cancer patients (Q1810974) (← links)
- Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem (Q1813445) (← links)
- Dedication: Richard Warren Cottle (Q1815071) (← links)
