Country: Germany

Found 3096 papers in total
Convergence and efficiency of subgradient methods for quasiconvex minimization
Convergence and efficiency of subgradient methods for quasiconvex minimization
2001,
We study a general subgradient projection method for minimizing a quasiconvex...
Logarithmic sequential unconstrained minimization technique limits in convex programming
Logarithmic sequential unconstrained minimization technique limits in convex programming
2001,
The limits of a class of primal and dual solution trajectories associated with the...
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
2001,
This note studies -->χ --> A , a condition number used in the linear programming...
On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations
On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations
2001,
In a recent paper, the authors have proved results characterizing convexity-preserving...
Quadratic convergence of potential-reduction methods for degenerate problems
Quadratic convergence of potential-reduction methods for degenerate problems
2001,
Global and local convergence properties of a primal–dual interior-point pure...
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
2001,
We analyze perturbations of the right-hand side and the cost parameters in linear...
Mixing mixed-integer inequalities
Mixing mixed-integer inequalities
2001,
Mixed-integer rounding inequalities play a central role in the development of strong...
On the convergence of the Newton/log-barrier method
On the convergence of the Newton/log-barrier method
2001,
In the Newton/log-barrier method, Newton steps are taken for the log-barrier function...
On reduced convex quadratic programming formulations of monotone linear complementarity problems
On reduced convex quadratic programming formulations of monotone linear complementarity problems
2001,
Techniques for transforming convex quadratic programs (QPs) into monotone linear...
A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
2001,
An algorithm incorporating the logarithmic barrier into the Benders decomposition...
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
2001,
Many optimization problems have several equivalent mathematical models. It is often...
Efficient optimization of cyclic labor days-off scheduling
Efficient optimization of cyclic labor days-off scheduling
2001,
An efficient method is presented for the optimum solution of the cyclic manpower...
A new bound for the quadratic assignment problem based on convex quadratic programming
A new bound for the quadratic assignment problem based on convex quadratic programming
2001,
We describe a new convex quadratic programming bound for the quadratic assignment...
On the stability of solutions to quadratic programming problems
On the stability of solutions to quadratic programming problems
2001,
We consider the parametric programming problem ( Q p ) of minimizing the quadratic...
A modified Weiszfeld algorithm for the Fermat–Weber location problem
A modified Weiszfeld algorithm for the Fermat–Weber location problem
2001,
This paper gives a new, simple, monotonically convergent, algorithm for the...
The uncapacitated lot-sizing problem with sales and safety stocks
The uncapacitated lot-sizing problem with sales and safety stocks
2001,
We examine a variant of the uncapacitated lot-sizing model of Wagner–Whitin...
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications
2001,
We obtain local estimates of the distance to a set defined by equality constraints...
On the generic properties of convex optimization problems in conic form
On the generic properties of convex optimization problems in conic form
2001,
We prove that strict complementarity, primal and dual nondegeneracy of optimal...
On the convexity of the multiplicative potential and penalty functions and related topics
On the convexity of the multiplicative potential and penalty functions and related topics
2001,
It is well known that a function f of the real variable x is convex if and only if (...
A disjunctive cutting plane procedure for general mixed-integer linear programs
A disjunctive cutting plane procedure for general mixed-integer linear programs
2001,
In this paper we develop a cutting plane algorithm for solving mixed-integer linear...
On two homogeneous self-dual approaches to linear programming and its extensions
On two homogeneous self-dual approaches to linear programming and its extensions
2001,
We investigate the relation between interior-point algorithms applied to two...
Parallel machine scheduling wth high multiplicity
Parallel machine scheduling wth high multiplicity
2001,
In high-multiplicity scheduling problems, identical jobs are encoded in the efficient...
Global optimization of nonconvex factorable programming problems
Global optimization of nonconvex factorable programming problems
2001,
In this paper, we consider a special class of nonconvex programming problems for which...
Hesitant adaptive search: The distribution of the number of iterations to convergence
Hesitant adaptive search: The distribution of the number of iterations to convergence
2001,
Hesitant adaptive search is a stochastic optimisation procedure which accommodates...
Papers per page: