Smoothing Methods for Convex Inequalities and Linear Complementarity Problems (1993)

Cached

Download Links

by Chunhui Chen , O. L. Mangasarian
Venue:Mathematical Programming
Citations:62 - 6 self

Active Bibliography

1 Smoothing Methods in Mathematical Programming – Chunhui Chen, At The
26 Error Bounds for Convex Inequality Systems – Adrian Lewis, Jong-shi Pang - 1996
9 Robust Solution Of Mixed Complementarity Problems – Steven P. Dirkse - 1994
2 Global Error Bounds for Convex Conic Problems – Shuzhong Zhang - 1998
13 SUFFICIENT CONDITIONS FOR ERROR BOUNDS – Zili Wu, Jane J. Ye - 2001
5 Mathematical Programming Approaches To Machine Learning And Data Mining – Paul S. Bradley - 1998
27 Machine Learning via Polyhedral Concave Minimization – O. L. Mangasarian - 1996
6 Algorithms and Environments for Complementarity – Todd S. Munson - 2000
41 Algorithms For Complementarity Problems And Generalized Equations – Stephen C. Billups - 1995
16 Global and Local Superlinear Convergence Analysis of Newton-Type Methods for Semismooth Equations with Smooth Least Squares – Houyuan Jiang, Daniel Ralph - 1998
2 Error Bounds for Inconsistent Linear Inequalities and Programs – O. L. Mangasarian - 1994
26 Mathematical Programming in Data Mining – O. L. Mangasarian - 1996
9 A linearly convergent derivative-free descent method for strongly monotone complementarity problems – O. L. Mangasarian
7 Convergence analysis of perturbed feasible descent methods – M. V. Solodov - 1997
3 Nonmonotone And Perturbed Optimization – Mikhail V. Solodov - 1995
6 Weak Sharp Minima Revisited Part I: Basic Theory – James V. Burke , et al. - 2002
Error bound results for convex inequality systems via conjugate duality – Radu Ioan Bot, Ernö Robert Csetnek - 2011
13 Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization – Heinz H. Bauschke, Jonathan M. Borwein, Wu Li - 1997
Global Error – Huynh Van Ngai