External Links

    Journal: Math. Program.

    Volume 88, Issue 3

    411 -- 424Aharon Ben-Tal, Arkadi Nemirovski. Robust solutions of Linear Programming problems contaminated with uncertain data
    425 -- 450Ralf Borndörfer, Robert Weismantel. Set packing relaxations of some integer programs
    451 -- 485Marina Epelman, Robert M. Freund. Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
    487 -- 505Michael C. Ferris, Todd S. Munson. Modeling languages and Condor: metacomputing for optimization
    507 -- 520Hiroshi Nagamochi, Toshihide Ibaraki. A fast algorithm for computing minimum 3-way and 4-way cuts
    521 -- 539Jean-Pierre Crouzeix, Patrice Marcotte, Daoli Zhu. Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
    541 -- 563Jeroen Kuipers, Tamás Solymosi, Harry Aarts. Computing the nucleolus of some combinatorially-structured games
    565 -- 574Andreas Wächter, Lorenz T. Biegler. Failure of global convergence for a class of interior point methods for nonlinear programming
    575 -- 587M. Seetharama Gowda, Yoon Song. On semidefinite linear complementarity problems

    Volume 88, Issue 2

    223 -- 253Martin Bartelt, Wu Li. Exact order of Hoffman's error bounds for elliptic quadratic inequalities derived from vector-valued Chebyshev approximation
    255 -- 275Martin Gugat. Error bounds for infinite systems of convex inequalities without Slater's condition
    277 -- 284Hui Hu. Perturbation analysis of global error bounds for systems of linear inequalities
    285 -- 311Diethard Klatte. 1, 1 programs
    313 -- 339Bernd Kummer. Inverse functions of pseudo regular mappings and regularity conditions
    341 -- 355Zhi-Quan Luo. New error bounds and their applications to convergence analysis of iterative algorithms
    357 -- 370Kung Fu Ng, Xi Yin Zheng. Global error bounds with fractional exponents
    371 -- 389Mikhail V. Solodov, Benar Fux Svaiter. Error bounds for proximal point subproblems and associated inexact proximal point algorithms
    391 -- 410Jianzhong Zhang 0001, Naihua Xiu. s -type error bound for the extended linear complementarity problem and applications

    Volume 88, Issue 1

    1 -- 31Thomas F. Coleman, Yuying Li. A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
    33 -- 44László Lipták, László Lovász. Facets with fixed defect of the stable set polytope
    45 -- 59Alfred Auslender. Existence of optimal solutions and duality results under weak conditions
    61 -- 83Renato D. C. Monteiro, Takashi Tsuchiya. Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
    85 -- 104Paul Tseng, Dimitri P. Bertsekas. An ε-relaxation method for separable convex cost generalized network flow problems
    105 -- 128Anders Forsgren. Optimality conditions for nonconvex semidefinite programming
    129 -- 146Satoru Fujishige, Kazuo Murota. Notes on L-/M-convex functions and the separation theorems
    147 -- 155Reinhard John. A first order characterization of generalized monotonicity
    157 -- 181James V. Burke, Maijian Qian. On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
    183 -- 192Paul Tseng. Co-NP-completeness of some matrix classification problems
    193 -- 210Masayuki Shida. Change of generalized indices of stationary solutions. to multiparametric optimization
    211 -- 216Bintong Chen, Xiaojun Chen 0001, Christian Kanzow. A penalized Fischer-Burmeister NCP-function
    217 -- 220Satoru Fujishige. A note on Faigle and Kern's dual greedy polyhedra
    runs on