Journal: Mathematical Programming (Series A)

Found 506 papers in total
A numerical approach to optimization problems with variational inequality constraints
1995,
Optimization problems with variational inequality constraints are converted to...
On co-positive, semi-monotone Q-matrices
1995,
In this paper the authors consider not necessarily symmetric co-positive as well as...
A characterization of weakly efficient points
1995,
In this paper, the authors study a characterization of weakly efficient solutions of...
Minimal representation of quadratically constrained convex feasible regions
1995,
In this paper the authors are concerned with characterizing minimal representations of...
A note on the strong polynomiality of convex quadratic programming
1995,
The authors prove that a general convex quadratic program (QP) can be reduced to the...
One-third-integrality in the max-cut problem
1995,
Given a graph , the metric polytope is defined by the inequalities for , odd, C cycle...
A polyhedron with all s-t cuts as vertices, and adjacency of cuts
1995,
Consider the polyhedron represented by the dual of the LP formulation of the maximum...
Asymptotic analysis of the exponential penalty trajectory in linear programming
1994,
The authors consider the linear program min∈ c'x:Ax•b} and the associated...
The P-matrix problem is co-NP-complete
1994,
Recently Rohn and Poljak proved that for interval matrices with rank-one radius...
On extremal behaviors of Murty’s least index method
1994,
In this note, the authors observe some extremal behaviors of Mutry’s least index...
A general cone decomposition theory based on efficiency
1994,
Let K 1 and K 2 be two convex cones in some common vector space. This paper is...
Global convergence in infeasible-interior-point algorithms
1994,
This paper presents a wide class of globally convergent interior-point algorithms for...
A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
1994,
A predictor-corrector method for solving linear programs from infeasible starting...
Formulation of linear problems and solution by a universal machine
1994,
Using the predicate language for ordered fields a class of problems referred to as...
A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
1994,
The paper proposes a two-stage successive overrelaxation method (TSOR) algorithm for...
A new method for a class of linear variational inequalities
1994,
The paper introduces a new iterative scheme for the numerical solution of a class of...
New improved error bounds for the linear complementarity problem
1994,
New local and global error bounds are given for both nonmonotone and monotone linear...
Solving mixed integer nonlinear programs by outer approximation
1994,
A wide range of optimization problems arising from engineering applications can be...
An infeasible-interior-point algorithm for linear complementarity problems
1994,
The paper modifies the algorithm of Zhang to obtain an O(n 2 L)...
Solving large-scale minimax problems with the primal-dual steepest descent algorithm
1994,
This paper shows that the primal-dual steepest descent algorithm developed by Zhu and...
Optimality conditions in mathematical programming and composite optimization
1994,
New second order optimality conditions for mathematical programming problems and for...
A saddle-point characterization of Pareto optima
1994,
This paper provides an answer to the following basic problem of convex multi-objective...
Error bounds for analytic systems and their applications
1994,
Using a 1958 result of Lojasiewicz, the authors establish an error bound for analytic...
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
1994,
The authors discuss the application of random walks to generating a random basis of a...
Papers per page: