Journal: Mathematical Programming

Found 797 papers in total
Set-valued approximations and Newton's methods
Set-valued approximations and Newton's methods
1999,
We introduce a point-based set-valued approximation for a mapping from R n to R m ....
Legendre-type optimality conditions for a variational problem with inequality state constraints
Legendre-type optimality conditions for a variational problem with inequality state constraints
1999,
We extend Legendre condition to a variational problem with inequality state...
A variable-penalty alternating directions method for convex optimization
A variable-penalty alternating directions method for convex optimization
1998,
We study a generalized version of the method of alternating directions as applied to...
Merit functions for semi-definite complementarity problems
Merit functions for semi-definite complementarity problems
1998,
Merit functions such as the gap function, the regularized gap function, the implicit...
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
1998,
A global error bound is given on the distance between an arbitrary point in the n...
Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems
Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems
1998,
In this paper several types of perturbations on a convex inequality system are...
Affine scaling algorithm fails for semidefinite programming
Affine scaling algorithm fails for semidefinite programming
1998,
In this paper, we introduce an affine scaling algorithm for semidefinite programming...
Minimizing symmetric submodular functions
Minimizing symmetric submodular functions
1998,
We describe a purely combinatorial algorithm which, given a submodular set function f...
Warm start of the primal–dual method applied in the cutting-plane scheme
Warm start of the primal–dual method applied in the cutting-plane scheme
1998,
A practical warm-start procedure is described for the infeasible primal–dual...
Discrete convex analysis
Discrete convex analysis
1998,
A theory of ‘discrete convex analysis’ is developed for integer-valued...
A modified layered-step interior-point algorithm for linear programming
A modified layered-step interior-point algorithm for linear programming
1998,
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The...
Condition measures and properties of the central trajectory of a linear program
Condition measures and properties of the central trajectory of a linear program
1998,
Given a data instance d = (A,b,c) of a linear program, we show that certain properties...
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
1999,
In this paper, we propose an infeasible-interior-point algorithm for solving a...
Analytical properties of the central path at boundary point in linear programming
Analytical properties of the central path at boundary point in linear programming
1999,
We study the properties of the weighted central paths in linear programming. We...
The role of linear objective functions in barrier methods
The role of linear objective functions in barrier methods
1999,
We consider the asymptotic behavior of the Newton/log barrier method for inequality...
On a homogeneous algorithm for the monotone complementarity problem
On a homogeneous algorithm for the monotone complementarity problem
1999,
We present a generalization of a homogeneous self-dual linear programming (LP)...
An improved approximation ratio for the minimum latency problem
An improved approximation ratio for the minimum latency problem
1998,
Given a tour visiting n points in a metric space, the latency of one of these points p...
Approximate iterations in Bregman-function-based proximal algorithms
Approximate iterations in Bregman-function-based proximal algorithms
1998,
This paper establishes convergence of generalized Bregman-function-based proximal...
Generalized semi-infinite optimization: A first order optimality condition and examples
Generalized semi-infinite optimization: A first order optimality condition and examples
1998,
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP)...
On finding an envy-free Pareto-optimal division
On finding an envy-free Pareto-optimal division
1998,
This paper describes an algorithm to find an (α-)envy-free Pareto-optimal...
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
1998,
In this paper we study the behavior of infeasible-interior-point-paths for solving...
Nonsmooth analysis of eigenvalues
Nonsmooth analysis of eigenvalues
1999,
The eigenvalues of a symmetric matrix depend on the matrix nonsmoothly. This paper...
Intersection theorems on polytopes
Intersection theorems on polytopes
1999,
Intersection theorems are used to prove the existence of solutions to mathematical...
Polynomiality of primal–dual algorithms for semidefinite linear complementarity problems based on the Kojima–Shindoh–Hara family of directions
Polynomiality of primal–dual algorithms for semidefinite linear complementarity problems based on the Kojima–Shindoh–Hara family of directions
1999,
Kojima, Shindoh and Hara proposed a family of search directions for the semidefinite...
Papers per page: