Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming Abdo Y. AlfakihAmir KhandaniHenry Wolkowicz OriginalPaper Pages: 13 - 30
A Logarithmic-Quadratic Proximal Method for Variational Inequalities Alfred AuslenderMarc TeboulleSami Ben-Tiba OriginalPaper Pages: 31 - 40
A Note on Error Bounds for Convex and Nonconvex Programs Dimitri P. Bertsekas OriginalPaper Pages: 41 - 51
Multicategory Classification by Support Vector Machines Erin J. BredensteinerKristin P. Bennett OriginalPaper Pages: 53 - 79
A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems Renato De LeoneRobert R. MeyerArmand Zakarian OriginalPaper Pages: 107 - 126
On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities M. DenaultJ.-L. Goffin OriginalPaper Pages: 127 - 155
A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems Gianni Di PilloStefano LucidiLaura Palagi OriginalPaper Pages: 157 - 188
Arithmetic Continuation of Regular Roots of Formal Parametric Polynomial Systems B. Curtis EavesUriel G. Rothblum OriginalPaper Pages: 189 - 205
Interfaces to PATH 3.0: Design, Implementation and Usage Michael C. FerrisTodd S. Munson OriginalPaper Pages: 207 - 227
Existence and Limiting Behavior of Trajectories Associated with P0-equations M. Seetharama GowdaM. A. Tawhid OriginalPaper Pages: 229 - 251