Journal: Mathematical Programming (Series A)

Found 506 papers in total
An efficient algorithm for the minimum capacity cut problem
An efficient algorithm for the minimum capacity cut problem
1990,
Given a finite undirected graph with nonnegative edge capacities the minimum capacity...
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time
1990,
The authors propose a primal network simplex algorithm for solving the maximum flow...
Concurrent stochastic methods for global optimization
Concurrent stochastic methods for global optimization
1990,
The global optimization problem, finding the lowest minimizer of a nonlinear function...
Relaxation methods for monotropic programs
Relaxation methods for monotropic programs
1990,
The authors propose a dual descent method for the problem of minimizing a convex,...
A filled function method for finding a global minimizer of a function of several variables
A filled function method for finding a global minimizer of a function of several variables
1990,
The concept of a filled function is introduced. The paper constructs a particular...
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
1990,
This paper gives an O( n) algorithm for a singly constrained convex quadratic program...
The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
1990,
In this paper the authors consider an augmented Lagrangian method for the minimization...
On Shapiro’s results in quasidifferential calculus
On Shapiro’s results in quasidifferential calculus
1990,
Several necessary minimum conditions for quasidifferentiable programming problems are...
On a subproblem of trust region algorithms for constrained optimization
On a subproblem of trust region algorithms for constrained optimization
1990,
The paper studies a subproblem that arises in some trust region algorithms for...
Convergence properties of trust region methods for linear and convex constraints
Convergence properties of trust region methods for linear and convex constraints
1990,
The authors develop a convergence theory for convex and linearly constrained trust...
General constraint qualifications in nondifferentiable programming
General constraint qualifications in nondifferentiable programming
1990,
The authors show that a familiar constraint qualification of differentiable...
A bifurcation analysis of the nonlinear parametric programming problem
A bifurcation analysis of the nonlinear parametric programming problem
1990,
The structure of solutions to the nonlinear parametric programming problem with a one...
A note on the continuity of solutions of parametric linear programs
A note on the continuity of solutions of parametric linear programs
1990,
This note shows that, if a parametric linear program, min{ cx:Ax=b 1 θ+b 2...
On differential stability in stochastic programming
On differential stability in stochastic programming
1990,
In this paper optimal solutions of a stochastic programming problem are considered as...
MSLiP: A computer code for the multistage stochastic linear programming problem
MSLiP: A computer code for the multistage stochastic linear programming problem
1990,
This paper describes an efficient implementation of a nested decomposition algorithm...
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos’ algorithm
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos’ algorithm
1990,
In a recent paper Tardos described a polynomial algorithm for solving linear...
A note on an implementation of a method for quadratic semi-infinite programming
A note on an implementation of a method for quadratic semi-infinite programming
1990,
For convex quadratic semi-infinite programming problems a
On the convergence properties of Hildreth’s quadratic programming algorithm
On the convergence properties of Hildreth’s quadratic programming algorithm
1990,
The authors prove the linear convergence rate of Hildreth’s method for quadratic...
Active set algorithms for isotonic regression; A unifying framework
Active set algorithms for isotonic regression; A unifying framework
1990,
In this and subsequent papers the authors will show that several algorithms for the...
Algebraic optimization: The Fermat-Weber location problem
Algebraic optimization: The Fermat-Weber location problem
1990,
The Fermat-Weber location problem is to find a point in ℝ n that minimizes the...
Approximate subdifferential and metric regularity: The finite-dimensional case
Approximate subdifferential and metric regularity: The finite-dimensional case
1990,
The notion of graphical metric regularity is introduced and conditions ensuring this...
Proximity control in bundle methods for convex nondifferentiable minimization
Proximity control in bundle methods for convex nondifferentiable minimization
1990,
Proximal bundle methods for minimizing a convex function f generate a sequence { x k }...
The generalized assignment problem: Valid constraints and facets
The generalized assignment problem: Valid constraints and facets
1990,
Three classes of valid inequalities based upon multiple knapsack constraints are...
(1,k)-Configuration facets for the generalized assignment problem
(1,k)-Configuration facets for the generalized assignment problem
1990,
A class of facet defining inequalities for the generalized assignment problem is...
Papers per page: