Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Mathematical Programming
Found
797 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Exact order of Hoffman's error bounds for elliptic quadratic inequalities derived from vector-valued Chebyshev approximation
2000,
Li W.
In this paper, we introduce the exact order of Hoffman's error bounds for approximate...
Upper Lipschitz behavior of solutions to perturbed C1,1 programs
2000,
Klatte D.
We analyze the local upper Lipschitz behavior of critical points, stationary solutions...
Inverse functions of pseudo regular mappings and regularity conditions
2000,
Kummer B.
We show that, even for monotone directionally differentiable Lipschitz functionals on...
Global error bounds with fractional exponents
2000,
Ng K.F.
Using the partial order induced by a proper weakly lower semicontinuous function on a...
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
2000,
Svaiter B.F.
We study various error measures for approximate solution of proximal point...
Global s-type error bound for the extended linear complementarity problem and applications
2000,
Zhang J.
For the extended linear complementarity problem over an affine subspace, we first...
Modeling languages and Condor: metacomputing for optimization
2000,
Ferris M.C.
A generic framework is postulated for utilizing the computational resources provided...
Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
2000,
Marcotte Patrice
Let VIP( F, C ) denote the variational inequality problem associated with the mapping...
On semidefinite linear complementarity problems
2000,
Gowda M.S.
Given a linear transformation L : S n → S n and a matrix Q ∈ S n , where S n...
The packing property
2000,
Cornujols G.
A clutter ( V, E ) packs if the smallest number of vertices needed to intersect all...
The stable admissions polytope
2000,
Baou Mourad
The stable admissions polytope – the convex hull of the stable assignments of...
A generalized assignment problem with special ordered sets: A polyhedral approach
2000,
Nemhauser George L.
We study a generalized assignment problem that arises in production scheduling in...
Existence of optimal solutions and duality results under weak conditions
2000,
Auslender A.
In this paper we consider an ordinary convex program with no qualification conditions...
Error bounds for infinite systems of convex inequalities without Slater's condition
2000,
Gugat M.
The feasible set of a convex semi-infinite program is described by a possibly infinite...
New error bounds and their applications to convergence analysis of iterative algorithms
2000,
Luo Z.-Q.
We present two new error bounds for optimization problems over a convex set whose...
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
2000,
Epelman M.
A conic linear system is a system of the form (FP d ) Ax = b, x ∈ C X , where A :...
A second-order bundle method to minimize the maximum eigenvalue function
2000,
Oustry F.
In this paper we present a nonsmooth algorithm to minimize the maximum eigenvalue of...
Set packing relaxations of some integer programs
2000,
Weismantel R.
This paper is about set packing relaxations of combinatorial optimization problems...
The mixed vertex packing problem
2000,
Savelsbergh M.W.P.
We study a generalization of the vertex packing problem having both binary and bounded...
Computing approximate solutions for convex conic systems of constraints
2000,
Pea J.
We propose a way to reformulate a conic system of constraints as an optimization...
The volume algorithm: producing primal solutions with a subgradient method
2000,
Barahona F.
We present an extension to the subgradient algorithm to produce primal as well as dual...
Perturbation analysis of global error bounds for systems of linear inequalities
2000,
Hu H.
This paper studies the existence of a uniform global error bound when a system of...
Robust solutions of Linear Programming problems contaminated with uncertain data
2000,
Ben-Tal A.
Optimal solutions of Linear Programming problems may become severely infeasible if the...
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
2000,
Sayn S.
One way of solving multiple objective mathematical programming problems is finding...
First Page
10
11
12
13
14
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers