Journal: Mathematical Programming

Found 797 papers in total
Sample-path optimization of convex stochastic performance functions
Sample-path optimization of convex stochastic performance functions
1996,
In this paper we propose a method for optimizing convex performance functions in...
On self-concordant barrier functions for conic hulls and fractional programming
On self-concordant barrier functions for conic hulls and fractional programming
1996,
Given a self-concordant barrier function for a convex set 𝒮, we determine a...
An infeasible interior-point algorithm for solving primal and dual geometric programs
An infeasible interior-point algorithm for solving primal and dual geometric programs
1997,
In this paper an algorithm is presented for solving the classical posynomial geometric...
Resolution and the integrality of satisfiability problems
Resolution and the integrality of satisfiability problems
1996,
A satisfiability problem can be regarded as a nondisjoint union of set covering...
{0, ½}-Chvátal–Gomory cuts
{0, ½}-Chvátal–Gomory cuts
1996,
Given the integer polyhedron P I ≔ conv{x ∈ ℤ n : Ax ⩽ b} , where...
Formulations and valid inequalities for the node capacitated graph partitioning problem
Formulations and valid inequalities for the node capacitated graph partitioning problem
1996,
We investigate the problem of partitioning the nodes of a graph under capacity...
A cutting plane approach to capacitated lot-sizing with start-up costs
A cutting plane approach to capacitated lot-sizing with start-up costs
1996,
We consider a mixed integer model for multi-item single machine production planning,...
Binary integer programs with two variables per inequality
Binary integer programs with two variables per inequality
1996,
Several recent papers have shown that some properties of the maximum weight stable set...
Asymptotic convergence in a generalized predictor–corrector method
Asymptotic convergence in a generalized predictor–corrector method
1996,
The asymptotic convergence properties of a generalized predictor–corrector...
A primal–dual interior point method whose running time depends only on the constraint matrix
A primal–dual interior point method whose running time depends only on the constraint matrix
1996,
We propose a primal–dual ‘layered-step’ interior point (LIP)...
A class of polynomial variable metric algorithms for linear optimization
A class of polynomial variable metric algorithms for linear optimization
1996,
In the paper, the behaviour of interior point algorithms is analyzed by using a...
Superlinear convergence of the affine scaling algorithm
Superlinear convergence of the affine scaling algorithm
1996,
In this paper we show that a variant of the long-step affine scaling algorithm (with...
Lipschitzian Q-matrices are P-matrices
Lipschitzian Q-matrices are P-matrices
1996,
In this note, we show that Lipschitzian Q -matrices are P -matrices by obtaining a...
Generalized Hessian for C1,1 functions in infinite dimensional normed spaces
Generalized Hessian for C1,1 functions in infinite dimensional normed spaces
1996,
The subject of this paper is the systematic study of second order notions concerning...
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
1996,
Using the theory of exact penalization for mathematical programs with subanalytic...
Potential-reduction methods in mathematical programming
Potential-reduction methods in mathematical programming
1997,
We provide a survey of interior-point methods for linear programming and its...
Long-step strategies in interior-point primal–dual methods
Long-step strategies in interior-point primal–dual methods
1997,
In this paper we analyze from a unique point of view the behavior of path-following...
Fast convergence of the simplified largest step path following algorithm
Fast convergence of the simplified largest step path following algorithm
1997,
Each master iteration of a simplified Newton algorithm for solving a system of...
Improved complexity using higher-order correctors for primal–dual Dikin affine scaling
Improved complexity using higher-order correctors for primal–dual Dikin affine scaling
1997,
In this paper we show that the primal–dual Dikin affine scaling algorithm for...
A QMR-based interior-point algorithm for solving linear programs
A QMR-based interior-point algorithm for solving linear programs
1997,
A new approach for the implementation of interior-point methods for solving linear...
On homogeneous and self-dual algorithms for the linear complementarity problem
On homogeneous and self-dual algorithms for the linear complementarity problem
1997,
We present some generalizations of a homogeneous and self-dual linear programming (LP)...
Predictor–corrector algorithm for solving the P*(κ)-matrix linear complementarity problem from arbitrary positive starting points
Predictor–corrector algorithm for solving the P*(κ)-matrix linear complementarity problem from arbitrary positive starting points
1997,
A new predictor–corrector algorithm is proposed for solving P *...
Volumetric path following algorithms for linear programming
Volumetric path following algorithms for linear programming
1997,
We consider the construction of small step path following algorithms using volumetric,...
The largest step path following algorithm for monotone linear complementarity problems
The largest step path following algorithm for monotone linear complementarity problems
1997,
Path-following algorithms take at each iteration a Newton step for approaching a point...
Papers per page: