Journal: Mathematical Programming

Found 797 papers in total
Stability in the presence of degeneracy and error estimation
Stability in the presence of degeneracy and error estimation
1999,
Given an approximation to a local minimizer to a nonlinear optimization problem and to...
Convergence of a simple subgradient level method
Convergence of a simple subgradient level method
1999,
We study the subgradient projection method for convex optimization with...
Proximal quasi-Newton methods for nondifferentiable convex optimization
Proximal quasi-Newton methods for nondifferentiable convex optimization
1999,
This paper proposes an implementable proximal quasi-Newton method for minimizing a...
Partition polytopes over 1-dimensional points
Partition polytopes over 1-dimensional points
1999,
We consider partitions of a finite set whose elements are associated with a single...
Robustness of posynomial geometric programming optima
Robustness of posynomial geometric programming optima
1999,
This paper develops a simple bounding procedure for the optimal value of a posynomial...
The 0–1 knapsack problem with a single continuous variable
The 0–1 knapsack problem with a single continuous variable
1999,
Constraints arising in practice often contain many 0–1 variables and one or a...
Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
1999,
We propose a family of directions that generalizes many directions proposed so far in...
A QP-free constrained Newton-type method for variational inequality problems
A QP-free constrained Newton-type method for variational inequality problems
1999,
We consider a simply constrained optimization reformulation of the...
A smoothing method for mathematical programs with equilibrium constraints
A smoothing method for mathematical programs with equilibrium constraints
1999,
The mathematical program with equilibrium constraints (MPEC) is an optimization...
A bundle Bregman proximal method for convex nondifferentiable minimization
A bundle Bregman proximal method for convex nondifferentiable minimization
1999,
We give a method for minimizing a convex function f that generates a sequence { x k }...
Q-matrix recognition via secondary and universal polytopes
Q-matrix recognition via secondary and universal polytopes
1999,
A square matrix M is a Q- matrix if every linear complementarity problem x T ( Mx...
Tight representation of logical constraints as cardinality rules
Tight representation of logical constraints as cardinality rules
1999,
A mathematical programming model may contain qualitative as well as quantitative...
Degeneracy in the multi-source Weber problem
Degeneracy in the multi-source Weber problem
1999,
This study investigates a new phenomenon of degeneracy in the multi-source Weber...
Fenchel-type duality for matroid valuations
Fenchel-type duality for matroid valuations
1998,
The weighted matroid intersection problem has recently been extended to the valuated...
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
1999,
We study the problem of protecting sensitive data in a statistical two-dimensional...
A cellation of the Grassmann manifold
A cellation of the Grassmann manifold
1998,
Motivated by the computation of equilibria in economic models with incomplete asset...
Plant location with minimum inventory
Plant location with minimum inventory
1998,
We present an integer programming model for plant location with inventory costs. The...
Location and shape of a rectangular facility in ℛn. Convexity properties
Location and shape of a rectangular facility in ℛn. Convexity properties
1998,
In this paper we address a generalization of the Weber problem, in which we seek for...
A note on ‘On Pareto optima, the Fermat–Weber problem, and polyhedral gauges’
A note on ‘On Pareto optima, the Fermat–Weber problem, and polyhedral gauges’
1999,
We show by counterexample that one of the results in the paper ‘On Pareto...
The nucleon of cooperative games and an algorithm for matching games
The nucleon of cooperative games and an algorithm for matching games
1998,
The nucleon is introduced as a new allocation concept for non-negative cooperative n...
Worst-case analyses, linear programming and the bin-packing problem
Worst-case analyses, linear programming and the bin-packing problem
1998,
In this paper we consider the familiar bin-packing problem and its associated...
Tensor methods for large sparse systems of nonlinear equations
Tensor methods for large sparse systems of nonlinear equations
1998,
This paper introduces tensor methods for solving large sparse systems of nonlinear...
Fully copositive matrices
Fully copositive matrices
1998,
The class of fully copositive ( C f 0 ) matrices is a subclass of fully semimonotone...
On proving existence of feasible points in equality constrained optimization problems
On proving existence of feasible points in equality constrained optimization problems
1998,
Various algorithms can compute approximate feasible points or approximate solutions to...
Papers per page: