Journal: Mathematical Programming

Found 797 papers in total
Ergodic, primal convergence in dual subgradient schemes for convex programming
Ergodic, primal convergence in dual subgradient schemes for convex programming
1999,
Lagrangean dualization and subgradient optimization techniques are frequently used...
bc-opt: A branch-and-cut code for mixed integer programs
bc-opt: A branch-and-cut code for mixed integer programs
1999,
A branch-and-cut mixed integer programming system, called bc-opt, is described,...
An infeasible-interior-point potential-reduction algorithm for linear programming
An infeasible-interior-point potential-reduction algorithm for linear programming
1999,
This paper studies a new potential-function and an infeasible-interior-point method...
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
2000,
In this paper we take a new look at smoothing Newton methods for solving the nonlinear...
Restricted 2-factor polytopes
Restricted 2-factor polytopes
2000,
The optimal k -restricted 2-factor problem consists of finding, in a complete...
A non-interior predictor–corrector path following algorithm for the monotone linear complementarity problem
A non-interior predictor–corrector path following algorithm for the monotone linear complementarity problem
2000,
We present a predictor–corrector non-interior path following algorithm for the...
Improving the robustness of descent-based methods for semismooth equations using proximal perturbations
Improving the robustness of descent-based methods for semismooth equations using proximal perturbations
2000,
A common difficulty encountered by descent-based equation solvers is convergence to a...
Forcing strong convergence of proximal point iterations in a Hilbert space
Forcing strong convergence of proximal point iterations in a Hilbert space
2000,
This paper concerns the convergence properties of the classical proximal point...
On the discovery of the ‘good Broyden’ method
On the discovery of the ‘good Broyden’ method
2000,
This short note traces the events that led to the unsymmetric rank one formula known...
Reminiscences on the development of the variational approach to Davidon's variable-metric method
Reminiscences on the development of the variational approach to Davidon's variable-metric method
2000,
In the mid-1960s, Davidon's method was brought to the author's attention by M.J.D....
On the convergence of the Davidon–Fletcher–Powell algorithm for unconstrained optimization when there are only two variables
On the convergence of the Davidon–Fletcher–Powell algorithm for unconstrained optimization when there are only two variables
2000,
Let the DFP algorithm for unconstrained optimization be applied to an objective...
Least-change quasi-Newton updates for equality-constrained optimization
Least-change quasi-Newton updates for equality-constrained optimization
2000,
This paper investigates quasi-Newton updates for equality-constrained optimization....
A probabilistic analysis of a measure of combinatorial complexity for the central curve
A probabilistic analysis of a measure of combinatorial complexity for the central curve
2000,
We investigate certain combinatorial properties of the central curve associated with...
A primal–dual trust-region algorithm for non-convex nonlinear programming
A primal–dual trust-region algorithm for non-convex nonlinear programming
2000,
A new primal–dual algorithm is proposed for the minimization of non-convex...
Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods
Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods
2000,
The paper extends prior work by the authors on LOQO, an interior point algorithm for...
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
2000,
We present a branch and cut algorithm that yields in finite time, a globally...
Stable reduced Hessian updates for indefinite quadratic programming
Stable reduced Hessian updates for indefinite quadratic programming
2000,
Stable techniques are considered for updating the reduced Hessian matrix that arises...
On the separation of maximally violated mod-k cuts
On the separation of maximally violated mod-k cuts
2000,
Separation is of fundamental importance in cutting-plane based techniques for Integer...
An outer approximate subdifferential method for piecewise affine optimization
An outer approximate subdifferential method for piecewise affine optimization
2000,
Piecewise affine functions arise from Lagrangian duals of integer programming...
Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure
Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure
1999,
In this paper we consider a two-person zero-sum discounted stochastic game with ARAT...
A non-interior continuation method for generalized linear complementarity problems
A non-interior continuation method for generalized linear complementarity problems
1999,
In this paper, we propose a non-interior continuation method for solving generalized...
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
1999,
A class of affine-scaling interior-point methods for bound constrained optimization...
A branch-and-cut method of 0–1 mixed convex programming
A branch-and-cut method of 0–1 mixed convex programming
1999,
We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols and...
Convex programming for disjunctive convex optimization
Convex programming for disjunctive convex optimization
1999,
Given a finite number of closed convex sets whose algebraic representation is known,...
Papers per page: